/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_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 20:12:00,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 20:12:00,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 20:12:00,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 20:12:00,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 20:12:00,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 20:12:00,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 20:12:00,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 20:12:00,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 20:12:00,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 20:12:00,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 20:12:00,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 20:12:00,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 20:12:00,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 20:12:00,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 20:12:00,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 20:12:00,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 20:12:00,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 20:12:00,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 20:12:00,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 20:12:00,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 20:12:00,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 20:12:00,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 20:12:00,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 20:12:00,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 20:12:00,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 20:12:00,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 20:12:00,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 20:12:00,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 20:12:00,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 20:12:00,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 20:12:00,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 20:12:00,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 20:12:00,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 20:12:00,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 20:12:00,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 20:12:01,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 20:12:01,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 20:12:01,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 20:12:01,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 20:12:01,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 20:12:01,004 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:01,026 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 20:12:01,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 20:12:01,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 20:12:01,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 20:12:01,028 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 20:12:01,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 20:12:01,029 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 20:12:01,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 20:12:01,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 20:12:01,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 20:12:01,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 20:12:01,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 20:12:01,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 20:12:01,030 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 20:12:01,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 20:12:01,030 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 20:12:01,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 20:12:01,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 20:12:01,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 20:12:01,031 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 20:12:01,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 20:12:01,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:12:01,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 20:12:01,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 20:12:01,032 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 20:12:01,032 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 20:12:01,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 20:12:01,033 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 20:12:01,033 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 20:12:01,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 20:12:01,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 20:12:01,354 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 20:12:01,355 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 20:12:01,356 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 20:12:01,356 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_6.bpl [2020-02-10 20:12:01,357 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_6.bpl' [2020-02-10 20:12:01,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 20:12:01,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 20:12:01,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 20:12:01,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 20:12:01,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 20:12:01,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 20:12:01,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 20:12:01,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 20:12:01,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 20:12:01,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 20:12:01,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 20:12:01,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 20:12:01,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 20:12:01,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_6.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,541 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 20:12:01,541 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 20:12:01,542 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 20:12:01,544 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 20:12:01,544 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 20:12:01,545 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 20:12:01,545 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 20:12:01,545 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 20:12:01,545 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 20:12:01,546 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 20:12:01,546 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 20:12:01,546 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 20:12:01,546 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 20:12:01,546 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 20:12:01,546 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 20:12:01,547 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 20:12:01,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 20:12:01,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 20:12:01,548 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 20:12:01,548 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 20:12:01,548 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 20:12:01,549 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,769 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 20:12:01,769 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 20:12:01,783 INFO L202 PluginConnector]: Adding new model example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:12:01 BoogieIcfgContainer [2020-02-10 20:12:01,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 20:12:01,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 20:12:01,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 20:12:01,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 20:12:01,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/2) ... [2020-02-10 20:12:01,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571500d3 and model type example_6.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,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:12:01" (2/2) ... [2020-02-10 20:12:01,807 INFO L109 eAbstractionObserver]: Analyzing ICFG example_6.bpl [2020-02-10 20:12:01,831 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 20:12:01,832 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 20:12:01,849 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 20:12:01,852 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 20:12:02,001 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-02-10 20:12:02,021 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 20:12:02,021 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 20:12:02,022 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 20:12:02,022 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 20:12:02,022 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 20:12:02,022 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 20:12:02,022 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 20:12:02,022 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 20:12:02,036 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 63 transitions [2020-02-10 20:12:02,038 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 52 places, 63 transitions [2020-02-10 20:12:02,157 INFO L129 PetriNetUnfolder]: 129/213 cut-off events. [2020-02-10 20:12:02,158 INFO L130 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2020-02-10 20:12:02,170 INFO L76 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 213 events. 129/213 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 773 event pairs. 0/212 useless extension candidates. Maximal degree in co-relation 187. Up to 60 conditions per place. [2020-02-10 20:12:02,176 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 52 places, 63 transitions [2020-02-10 20:12:02,248 INFO L129 PetriNetUnfolder]: 129/213 cut-off events. [2020-02-10 20:12:02,248 INFO L130 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2020-02-10 20:12:02,252 INFO L76 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 213 events. 129/213 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 773 event pairs. 0/212 useless extension candidates. Maximal degree in co-relation 187. Up to 60 conditions per place. [2020-02-10 20:12:02,257 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 780 [2020-02-10 20:12:02,259 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 20:12:02,400 INFO L206 etLargeBlockEncoding]: Checked pairs total: 225 [2020-02-10 20:12:02,401 INFO L214 etLargeBlockEncoding]: Total number of compositions: 7 [2020-02-10 20:12:02,412 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 56 transitions [2020-02-10 20:12:02,508 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 794 states. [2020-02-10 20:12:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states. [2020-02-10 20:12:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:02,542 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:02,543 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:02,543 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:02,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:02,550 INFO L82 PathProgramCache]: Analyzing trace with hash -773222054, now seen corresponding path program 1 times [2020-02-10 20:12:02,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:02,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770947611] [2020-02-10 20:12:02,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:02,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770947611] [2020-02-10 20:12:02,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:02,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:02,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437941115] [2020-02-10 20:12:02,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:02,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:02,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:02,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:02,725 INFO L87 Difference]: Start difference. First operand 794 states. Second operand 3 states. [2020-02-10 20:12:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:02,792 INFO L93 Difference]: Finished difference Result 602 states and 2198 transitions. [2020-02-10 20:12:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:02,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-02-10 20:12:02,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:02,844 INFO L225 Difference]: With dead ends: 602 [2020-02-10 20:12:02,844 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 20:12:02,846 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,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 20:12:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2020-02-10 20:12:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2020-02-10 20:12:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 2197 transitions. [2020-02-10 20:12:02,945 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 2197 transitions. Word has length 19 [2020-02-10 20:12:02,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:02,948 INFO L479 AbstractCegarLoop]: Abstraction has 601 states and 2197 transitions. [2020-02-10 20:12:02,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 2197 transitions. [2020-02-10 20:12:02,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:02,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:02,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:02,953 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:02,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:02,954 INFO L82 PathProgramCache]: Analyzing trace with hash 969558490, now seen corresponding path program 1 times [2020-02-10 20:12:02,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:02,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977609808] [2020-02-10 20:12:02,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:02,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:02,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977609808] [2020-02-10 20:12:02,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:02,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:02,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294072535] [2020-02-10 20:12:02,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:02,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:02,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:02,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:02,995 INFO L87 Difference]: Start difference. First operand 601 states and 2197 transitions. Second operand 3 states. [2020-02-10 20:12:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:03,015 INFO L93 Difference]: Finished difference Result 417 states and 1445 transitions. [2020-02-10 20:12:03,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:03,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-02-10 20:12:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:03,020 INFO L225 Difference]: With dead ends: 417 [2020-02-10 20:12:03,020 INFO L226 Difference]: Without dead ends: 417 [2020-02-10 20:12:03,021 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:03,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-02-10 20:12:03,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2020-02-10 20:12:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-02-10 20:12:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1445 transitions. [2020-02-10 20:12:03,049 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1445 transitions. Word has length 19 [2020-02-10 20:12:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:03,049 INFO L479 AbstractCegarLoop]: Abstraction has 417 states and 1445 transitions. [2020-02-10 20:12:03,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1445 transitions. [2020-02-10 20:12:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:03,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:03,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:03,054 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:03,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash 160210872, now seen corresponding path program 1 times [2020-02-10 20:12:03,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:03,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082299889] [2020-02-10 20:12:03,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:03,678 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2020-02-10 20:12:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:03,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082299889] [2020-02-10 20:12:03,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:03,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:03,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520499662] [2020-02-10 20:12:03,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:03,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:03,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:03,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:03,686 INFO L87 Difference]: Start difference. First operand 417 states and 1445 transitions. Second operand 8 states. [2020-02-10 20:12:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:03,795 INFO L93 Difference]: Finished difference Result 861 states and 2672 transitions. [2020-02-10 20:12:03,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:03,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:03,802 INFO L225 Difference]: With dead ends: 861 [2020-02-10 20:12:03,802 INFO L226 Difference]: Without dead ends: 823 [2020-02-10 20:12:03,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2020-02-10 20:12:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 447. [2020-02-10 20:12:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-02-10 20:12:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1541 transitions. [2020-02-10 20:12:03,829 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1541 transitions. Word has length 19 [2020-02-10 20:12:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:03,830 INFO L479 AbstractCegarLoop]: Abstraction has 447 states and 1541 transitions. [2020-02-10 20:12:03,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1541 transitions. [2020-02-10 20:12:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [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, 1, 1, 1] [2020-02-10 20:12:03,832 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_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 534862058, now seen corresponding path program 2 times [2020-02-10 20:12:03,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:03,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257903061] [2020-02-10 20:12:03,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:04,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:04,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257903061] [2020-02-10 20:12:04,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:04,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:04,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59110801] [2020-02-10 20:12:04,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:04,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:04,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:04,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:04,229 INFO L87 Difference]: Start difference. First operand 447 states and 1541 transitions. Second operand 8 states. [2020-02-10 20:12:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:04,357 INFO L93 Difference]: Finished difference Result 871 states and 2699 transitions. [2020-02-10 20:12:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:04,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:04,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:04,366 INFO L225 Difference]: With dead ends: 871 [2020-02-10 20:12:04,366 INFO L226 Difference]: Without dead ends: 812 [2020-02-10 20:12:04,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-02-10 20:12:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 436. [2020-02-10 20:12:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-02-10 20:12:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1507 transitions. [2020-02-10 20:12:04,400 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1507 transitions. Word has length 19 [2020-02-10 20:12:04,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:04,400 INFO L479 AbstractCegarLoop]: Abstraction has 436 states and 1507 transitions. [2020-02-10 20:12:04,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1507 transitions. [2020-02-10 20:12:04,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:04,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:04,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:04,404 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:04,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:04,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1341600626, now seen corresponding path program 3 times [2020-02-10 20:12:04,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:04,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348537700] [2020-02-10 20:12:04,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:04,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348537700] [2020-02-10 20:12:04,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:04,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:04,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554344815] [2020-02-10 20:12:04,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:04,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:04,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:04,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:04,775 INFO L87 Difference]: Start difference. First operand 436 states and 1507 transitions. Second operand 8 states. [2020-02-10 20:12:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:04,863 INFO L93 Difference]: Finished difference Result 855 states and 2646 transitions. [2020-02-10 20:12:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:04,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:04,870 INFO L225 Difference]: With dead ends: 855 [2020-02-10 20:12:04,871 INFO L226 Difference]: Without dead ends: 817 [2020-02-10 20:12:04,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2020-02-10 20:12:04,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 445. [2020-02-10 20:12:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-02-10 20:12:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1528 transitions. [2020-02-10 20:12:04,896 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1528 transitions. Word has length 19 [2020-02-10 20:12:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:04,896 INFO L479 AbstractCegarLoop]: Abstraction has 445 states and 1528 transitions. [2020-02-10 20:12:04,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1528 transitions. [2020-02-10 20:12:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:04,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:04,899 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:04,899 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:04,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:04,899 INFO L82 PathProgramCache]: Analyzing trace with hash 365395876, now seen corresponding path program 4 times [2020-02-10 20:12:04,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:04,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74229160] [2020-02-10 20:12:04,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:05,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74229160] [2020-02-10 20:12:05,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:05,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:05,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744142668] [2020-02-10 20:12:05,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:05,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:05,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:05,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:05,161 INFO L87 Difference]: Start difference. First operand 445 states and 1528 transitions. Second operand 8 states. [2020-02-10 20:12:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:05,264 INFO L93 Difference]: Finished difference Result 861 states and 2662 transitions. [2020-02-10 20:12:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:05,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:05,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:05,272 INFO L225 Difference]: With dead ends: 861 [2020-02-10 20:12:05,272 INFO L226 Difference]: Without dead ends: 808 [2020-02-10 20:12:05,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-02-10 20:12:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 436. [2020-02-10 20:12:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-02-10 20:12:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1498 transitions. [2020-02-10 20:12:05,295 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1498 transitions. Word has length 19 [2020-02-10 20:12:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:05,296 INFO L479 AbstractCegarLoop]: Abstraction has 436 states and 1498 transitions. [2020-02-10 20:12:05,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1498 transitions. [2020-02-10 20:12:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:05,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:05,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:05,298 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:05,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1763599130, now seen corresponding path program 5 times [2020-02-10 20:12:05,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:05,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994211075] [2020-02-10 20:12:05,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:05,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994211075] [2020-02-10 20:12:05,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:05,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:05,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575105665] [2020-02-10 20:12:05,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:05,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:05,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:05,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:05,688 INFO L87 Difference]: Start difference. First operand 436 states and 1498 transitions. Second operand 8 states. [2020-02-10 20:12:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:05,780 INFO L93 Difference]: Finished difference Result 882 states and 2745 transitions. [2020-02-10 20:12:05,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:05,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:05,787 INFO L225 Difference]: With dead ends: 882 [2020-02-10 20:12:05,788 INFO L226 Difference]: Without dead ends: 834 [2020-02-10 20:12:05,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2020-02-10 20:12:05,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 452. [2020-02-10 20:12:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-02-10 20:12:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1546 transitions. [2020-02-10 20:12:05,811 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1546 transitions. Word has length 19 [2020-02-10 20:12:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:05,811 INFO L479 AbstractCegarLoop]: Abstraction has 452 states and 1546 transitions. [2020-02-10 20:12:05,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:05,811 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1546 transitions. [2020-02-10 20:12:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:05,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:05,814 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:05,814 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:05,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:05,814 INFO L82 PathProgramCache]: Analyzing trace with hash -905319246, now seen corresponding path program 6 times [2020-02-10 20:12:05,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:05,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224053684] [2020-02-10 20:12:05,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:06,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224053684] [2020-02-10 20:12:06,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:06,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:06,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074086761] [2020-02-10 20:12:06,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:06,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:06,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:06,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:06,084 INFO L87 Difference]: Start difference. First operand 452 states and 1546 transitions. Second operand 8 states. [2020-02-10 20:12:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:06,175 INFO L93 Difference]: Finished difference Result 878 states and 2717 transitions. [2020-02-10 20:12:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:06,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:06,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:06,182 INFO L225 Difference]: With dead ends: 878 [2020-02-10 20:12:06,182 INFO L226 Difference]: Without dead ends: 807 [2020-02-10 20:12:06,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2020-02-10 20:12:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 425. [2020-02-10 20:12:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-02-10 20:12:06,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1468 transitions. [2020-02-10 20:12:06,204 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1468 transitions. Word has length 19 [2020-02-10 20:12:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:06,205 INFO L479 AbstractCegarLoop]: Abstraction has 425 states and 1468 transitions. [2020-02-10 20:12:06,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1468 transitions. [2020-02-10 20:12:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:06,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:06,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:06,207 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:06,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:06,208 INFO L82 PathProgramCache]: Analyzing trace with hash 903297962, now seen corresponding path program 7 times [2020-02-10 20:12:06,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:06,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222775396] [2020-02-10 20:12:06,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:06,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222775396] [2020-02-10 20:12:06,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:06,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:06,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516518282] [2020-02-10 20:12:06,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:06,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:06,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:06,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:06,524 INFO L87 Difference]: Start difference. First operand 425 states and 1468 transitions. Second operand 8 states. [2020-02-10 20:12:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:06,600 INFO L93 Difference]: Finished difference Result 838 states and 2569 transitions. [2020-02-10 20:12:06,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:06,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:06,607 INFO L225 Difference]: With dead ends: 838 [2020-02-10 20:12:06,607 INFO L226 Difference]: Without dead ends: 800 [2020-02-10 20:12:06,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2020-02-10 20:12:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 442. [2020-02-10 20:12:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-02-10 20:12:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1513 transitions. [2020-02-10 20:12:06,630 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1513 transitions. Word has length 19 [2020-02-10 20:12:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:06,630 INFO L479 AbstractCegarLoop]: Abstraction has 442 states and 1513 transitions. [2020-02-10 20:12:06,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1513 transitions. [2020-02-10 20:12:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:06,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:06,633 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:06,633 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:06,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1277949148, now seen corresponding path program 8 times [2020-02-10 20:12:06,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:06,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557401478] [2020-02-10 20:12:06,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:06,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557401478] [2020-02-10 20:12:06,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:06,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:06,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114740859] [2020-02-10 20:12:06,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:06,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:06,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:06,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:06,889 INFO L87 Difference]: Start difference. First operand 442 states and 1513 transitions. Second operand 8 states. [2020-02-10 20:12:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:07,012 INFO L93 Difference]: Finished difference Result 848 states and 2596 transitions. [2020-02-10 20:12:07,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:07,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:07,019 INFO L225 Difference]: With dead ends: 848 [2020-02-10 20:12:07,019 INFO L226 Difference]: Without dead ends: 789 [2020-02-10 20:12:07,019 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2020-02-10 20:12:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 431. [2020-02-10 20:12:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-02-10 20:12:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1483 transitions. [2020-02-10 20:12:07,038 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1483 transitions. Word has length 19 [2020-02-10 20:12:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:07,039 INFO L479 AbstractCegarLoop]: Abstraction has 431 states and 1483 transitions. [2020-02-10 20:12:07,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1483 transitions. [2020-02-10 20:12:07,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:07,042 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:07,042 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:07,042 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:07,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:07,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1759091492, now seen corresponding path program 9 times [2020-02-10 20:12:07,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:07,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324795927] [2020-02-10 20:12:07,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:07,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324795927] [2020-02-10 20:12:07,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:07,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:07,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141520126] [2020-02-10 20:12:07,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:07,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:07,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:07,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:07,285 INFO L87 Difference]: Start difference. First operand 431 states and 1483 transitions. Second operand 8 states. [2020-02-10 20:12:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:07,365 INFO L93 Difference]: Finished difference Result 821 states and 2505 transitions. [2020-02-10 20:12:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:07,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:07,371 INFO L225 Difference]: With dead ends: 821 [2020-02-10 20:12:07,371 INFO L226 Difference]: Without dead ends: 783 [2020-02-10 20:12:07,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2020-02-10 20:12:07,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 436. [2020-02-10 20:12:07,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-02-10 20:12:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1492 transitions. [2020-02-10 20:12:07,394 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1492 transitions. Word has length 19 [2020-02-10 20:12:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:07,394 INFO L479 AbstractCegarLoop]: Abstraction has 436 states and 1492 transitions. [2020-02-10 20:12:07,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1492 transitions. [2020-02-10 20:12:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:07,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:07,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:07,397 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:07,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1008029398, now seen corresponding path program 10 times [2020-02-10 20:12:07,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:07,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010349711] [2020-02-10 20:12:07,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:07,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010349711] [2020-02-10 20:12:07,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:07,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:07,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557202777] [2020-02-10 20:12:07,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:07,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:07,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:07,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:07,730 INFO L87 Difference]: Start difference. First operand 436 states and 1492 transitions. Second operand 8 states. [2020-02-10 20:12:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:07,813 INFO L93 Difference]: Finished difference Result 820 states and 2499 transitions. [2020-02-10 20:12:07,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:07,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:07,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:07,819 INFO L225 Difference]: With dead ends: 820 [2020-02-10 20:12:07,820 INFO L226 Difference]: Without dead ends: 778 [2020-02-10 20:12:07,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2020-02-10 20:12:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 431. [2020-02-10 20:12:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-02-10 20:12:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1478 transitions. [2020-02-10 20:12:07,837 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1478 transitions. Word has length 19 [2020-02-10 20:12:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:07,837 INFO L479 AbstractCegarLoop]: Abstraction has 431 states and 1478 transitions. [2020-02-10 20:12:07,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1478 transitions. [2020-02-10 20:12:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:07,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:07,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:07,839 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:07,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:07,840 INFO L82 PathProgramCache]: Analyzing trace with hash -262091078, now seen corresponding path program 11 times [2020-02-10 20:12:07,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:07,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876725317] [2020-02-10 20:12:07,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:08,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:08,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876725317] [2020-02-10 20:12:08,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:08,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:08,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437245404] [2020-02-10 20:12:08,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:08,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:08,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:08,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:08,063 INFO L87 Difference]: Start difference. First operand 431 states and 1478 transitions. Second operand 8 states. [2020-02-10 20:12:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:08,143 INFO L93 Difference]: Finished difference Result 845 states and 2591 transitions. [2020-02-10 20:12:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:08,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:08,149 INFO L225 Difference]: With dead ends: 845 [2020-02-10 20:12:08,149 INFO L226 Difference]: Without dead ends: 797 [2020-02-10 20:12:08,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2020-02-10 20:12:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 440. [2020-02-10 20:12:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-02-10 20:12:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1500 transitions. [2020-02-10 20:12:08,167 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1500 transitions. Word has length 19 [2020-02-10 20:12:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:08,168 INFO L479 AbstractCegarLoop]: Abstraction has 440 states and 1500 transitions. [2020-02-10 20:12:08,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1500 transitions. [2020-02-10 20:12:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:08,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:08,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:08,170 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash -262685724, now seen corresponding path program 12 times [2020-02-10 20:12:08,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:08,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428344093] [2020-02-10 20:12:08,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:08,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428344093] [2020-02-10 20:12:08,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:08,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:08,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194610304] [2020-02-10 20:12:08,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:08,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:08,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:08,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:08,372 INFO L87 Difference]: Start difference. First operand 440 states and 1500 transitions. Second operand 8 states. [2020-02-10 20:12:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:08,468 INFO L93 Difference]: Finished difference Result 834 states and 2544 transitions. [2020-02-10 20:12:08,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:08,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:08,474 INFO L225 Difference]: With dead ends: 834 [2020-02-10 20:12:08,474 INFO L226 Difference]: Without dead ends: 782 [2020-02-10 20:12:08,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2020-02-10 20:12:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 425. [2020-02-10 20:12:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-02-10 20:12:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1462 transitions. [2020-02-10 20:12:08,491 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1462 transitions. Word has length 19 [2020-02-10 20:12:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:08,491 INFO L479 AbstractCegarLoop]: Abstraction has 425 states and 1462 transitions. [2020-02-10 20:12:08,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1462 transitions. [2020-02-10 20:12:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:08,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:08,493 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:08,493 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:08,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:08,494 INFO L82 PathProgramCache]: Analyzing trace with hash -272531798, now seen corresponding path program 13 times [2020-02-10 20:12:08,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:08,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741825114] [2020-02-10 20:12:08,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:08,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741825114] [2020-02-10 20:12:08,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:08,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:08,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322986462] [2020-02-10 20:12:08,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:08,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:08,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:08,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:08,779 INFO L87 Difference]: Start difference. First operand 425 states and 1462 transitions. Second operand 8 states. [2020-02-10 20:12:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:08,855 INFO L93 Difference]: Finished difference Result 813 states and 2484 transitions. [2020-02-10 20:12:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:08,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:08,860 INFO L225 Difference]: With dead ends: 813 [2020-02-10 20:12:08,861 INFO L226 Difference]: Without dead ends: 775 [2020-02-10 20:12:08,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-02-10 20:12:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 435. [2020-02-10 20:12:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-02-10 20:12:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1490 transitions. [2020-02-10 20:12:08,879 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1490 transitions. Word has length 19 [2020-02-10 20:12:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:08,879 INFO L479 AbstractCegarLoop]: Abstraction has 435 states and 1490 transitions. [2020-02-10 20:12:08,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1490 transitions. [2020-02-10 20:12:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:08,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:08,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:08,881 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:08,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:08,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1023593892, now seen corresponding path program 14 times [2020-02-10 20:12:08,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:08,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782857463] [2020-02-10 20:12:08,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:09,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782857463] [2020-02-10 20:12:09,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:09,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:09,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455044211] [2020-02-10 20:12:09,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:09,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:09,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:09,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:09,133 INFO L87 Difference]: Start difference. First operand 435 states and 1490 transitions. Second operand 8 states. [2020-02-10 20:12:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:09,236 INFO L93 Difference]: Finished difference Result 812 states and 2478 transitions. [2020-02-10 20:12:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:09,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:09,243 INFO L225 Difference]: With dead ends: 812 [2020-02-10 20:12:09,244 INFO L226 Difference]: Without dead ends: 770 [2020-02-10 20:12:09,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:09,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2020-02-10 20:12:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 430. [2020-02-10 20:12:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-02-10 20:12:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1476 transitions. [2020-02-10 20:12:09,260 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1476 transitions. Word has length 19 [2020-02-10 20:12:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:09,261 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 1476 transitions. [2020-02-10 20:12:09,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1476 transitions. [2020-02-10 20:12:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:09,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:09,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:09,263 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:09,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:09,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1872969652, now seen corresponding path program 15 times [2020-02-10 20:12:09,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:09,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567036493] [2020-02-10 20:12:09,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:09,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567036493] [2020-02-10 20:12:09,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:09,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:09,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109444247] [2020-02-10 20:12:09,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:09,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:09,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:09,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:09,534 INFO L87 Difference]: Start difference. First operand 430 states and 1476 transitions. Second operand 8 states. [2020-02-10 20:12:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:09,596 INFO L93 Difference]: Finished difference Result 824 states and 2521 transitions. [2020-02-10 20:12:09,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:09,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:09,602 INFO L225 Difference]: With dead ends: 824 [2020-02-10 20:12:09,602 INFO L226 Difference]: Without dead ends: 786 [2020-02-10 20:12:09,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2020-02-10 20:12:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 439. [2020-02-10 20:12:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-02-10 20:12:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1497 transitions. [2020-02-10 20:12:09,618 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1497 transitions. Word has length 19 [2020-02-10 20:12:09,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:09,618 INFO L479 AbstractCegarLoop]: Abstraction has 439 states and 1497 transitions. [2020-02-10 20:12:09,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1497 transitions. [2020-02-10 20:12:09,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:09,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:09,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:09,620 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:09,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:09,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1445792894, now seen corresponding path program 16 times [2020-02-10 20:12:09,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:09,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452899785] [2020-02-10 20:12:09,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:09,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452899785] [2020-02-10 20:12:09,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:09,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:09,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034054808] [2020-02-10 20:12:09,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:09,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:09,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:09,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:09,827 INFO L87 Difference]: Start difference. First operand 439 states and 1497 transitions. Second operand 8 states. [2020-02-10 20:12:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:09,940 INFO L93 Difference]: Finished difference Result 830 states and 2537 transitions. [2020-02-10 20:12:09,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:09,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:09,946 INFO L225 Difference]: With dead ends: 830 [2020-02-10 20:12:09,946 INFO L226 Difference]: Without dead ends: 777 [2020-02-10 20:12:09,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:09,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2020-02-10 20:12:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 430. [2020-02-10 20:12:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-02-10 20:12:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1471 transitions. [2020-02-10 20:12:09,964 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1471 transitions. Word has length 19 [2020-02-10 20:12:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:09,964 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 1471 transitions. [2020-02-10 20:12:09,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1471 transitions. [2020-02-10 20:12:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:09,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:09,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:09,966 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:09,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:09,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1221170070, now seen corresponding path program 17 times [2020-02-10 20:12:09,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:09,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693029019] [2020-02-10 20:12:09,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:10,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693029019] [2020-02-10 20:12:10,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:10,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:10,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186190550] [2020-02-10 20:12:10,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:10,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:10,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:10,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:10,234 INFO L87 Difference]: Start difference. First operand 430 states and 1471 transitions. Second operand 8 states. [2020-02-10 20:12:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:10,331 INFO L93 Difference]: Finished difference Result 821 states and 2512 transitions. [2020-02-10 20:12:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:10,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:10,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:10,348 INFO L225 Difference]: With dead ends: 821 [2020-02-10 20:12:10,348 INFO L226 Difference]: Without dead ends: 784 [2020-02-10 20:12:10,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:10,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-02-10 20:12:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 438. [2020-02-10 20:12:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-02-10 20:12:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1491 transitions. [2020-02-10 20:12:10,372 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1491 transitions. Word has length 19 [2020-02-10 20:12:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:10,373 INFO L479 AbstractCegarLoop]: Abstraction has 438 states and 1491 transitions. [2020-02-10 20:12:10,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1491 transitions. [2020-02-10 20:12:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:10,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:10,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:10,376 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:10,377 INFO L82 PathProgramCache]: Analyzing trace with hash -362295540, now seen corresponding path program 18 times [2020-02-10 20:12:10,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:10,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727259289] [2020-02-10 20:12:10,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:10,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:10,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727259289] [2020-02-10 20:12:10,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:10,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:10,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462910083] [2020-02-10 20:12:10,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:10,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:10,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:10,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:10,628 INFO L87 Difference]: Start difference. First operand 438 states and 1491 transitions. Second operand 8 states. [2020-02-10 20:12:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:10,705 INFO L93 Difference]: Finished difference Result 828 states and 2530 transitions. [2020-02-10 20:12:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:10,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:10,709 INFO L225 Difference]: With dead ends: 828 [2020-02-10 20:12:10,709 INFO L226 Difference]: Without dead ends: 771 [2020-02-10 20:12:10,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2020-02-10 20:12:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 425. [2020-02-10 20:12:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-02-10 20:12:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1457 transitions. [2020-02-10 20:12:10,725 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1457 transitions. Word has length 19 [2020-02-10 20:12:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:10,725 INFO L479 AbstractCegarLoop]: Abstraction has 425 states and 1457 transitions. [2020-02-10 20:12:10,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1457 transitions. [2020-02-10 20:12:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:10,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:10,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:10,727 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1500056126, now seen corresponding path program 19 times [2020-02-10 20:12:10,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:10,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771913827] [2020-02-10 20:12:10,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:10,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:10,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771913827] [2020-02-10 20:12:10,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:10,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:10,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541406436] [2020-02-10 20:12:10,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:10,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:10,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:10,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:10,934 INFO L87 Difference]: Start difference. First operand 425 states and 1457 transitions. Second operand 8 states. [2020-02-10 20:12:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:11,006 INFO L93 Difference]: Finished difference Result 861 states and 2675 transitions. [2020-02-10 20:12:11,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:11,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:11,014 INFO L225 Difference]: With dead ends: 861 [2020-02-10 20:12:11,014 INFO L226 Difference]: Without dead ends: 813 [2020-02-10 20:12:11,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:11,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2020-02-10 20:12:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 442. [2020-02-10 20:12:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-02-10 20:12:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1515 transitions. [2020-02-10 20:12:11,029 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1515 transitions. Word has length 19 [2020-02-10 20:12:11,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:11,030 INFO L479 AbstractCegarLoop]: Abstraction has 442 states and 1515 transitions. [2020-02-10 20:12:11,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1515 transitions. [2020-02-10 20:12:11,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:11,031 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:11,032 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:11,032 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:11,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1499461480, now seen corresponding path program 20 times [2020-02-10 20:12:11,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:11,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613527897] [2020-02-10 20:12:11,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:11,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613527897] [2020-02-10 20:12:11,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:11,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:11,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971669551] [2020-02-10 20:12:11,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:11,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:11,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:11,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:11,288 INFO L87 Difference]: Start difference. First operand 442 states and 1515 transitions. Second operand 8 states. [2020-02-10 20:12:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:11,387 INFO L93 Difference]: Finished difference Result 850 states and 2628 transitions. [2020-02-10 20:12:11,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:11,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:11,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:11,395 INFO L225 Difference]: With dead ends: 850 [2020-02-10 20:12:11,395 INFO L226 Difference]: Without dead ends: 804 [2020-02-10 20:12:11,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2020-02-10 20:12:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 433. [2020-02-10 20:12:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-02-10 20:12:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1485 transitions. [2020-02-10 20:12:11,412 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1485 transitions. Word has length 19 [2020-02-10 20:12:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:11,413 INFO L479 AbstractCegarLoop]: Abstraction has 433 states and 1485 transitions. [2020-02-10 20:12:11,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1485 transitions. [2020-02-10 20:12:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:11,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:11,415 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:11,415 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:11,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1939604516, now seen corresponding path program 21 times [2020-02-10 20:12:11,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:11,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460415107] [2020-02-10 20:12:11,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:11,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460415107] [2020-02-10 20:12:11,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:11,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:11,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074424240] [2020-02-10 20:12:11,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:11,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:11,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:11,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:11,650 INFO L87 Difference]: Start difference. First operand 433 states and 1485 transitions. Second operand 8 states. [2020-02-10 20:12:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:11,728 INFO L93 Difference]: Finished difference Result 875 states and 2726 transitions. [2020-02-10 20:12:11,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:11,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:11,731 INFO L225 Difference]: With dead ends: 875 [2020-02-10 20:12:11,731 INFO L226 Difference]: Without dead ends: 827 [2020-02-10 20:12:11,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2020-02-10 20:12:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 449. [2020-02-10 20:12:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-02-10 20:12:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1533 transitions. [2020-02-10 20:12:11,747 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1533 transitions. Word has length 19 [2020-02-10 20:12:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:11,748 INFO L479 AbstractCegarLoop]: Abstraction has 449 states and 1533 transitions. [2020-02-10 20:12:11,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1533 transitions. [2020-02-10 20:12:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:11,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:11,749 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:11,750 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:11,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:11,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1081324632, now seen corresponding path program 22 times [2020-02-10 20:12:11,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:11,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466568835] [2020-02-10 20:12:11,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:11,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466568835] [2020-02-10 20:12:11,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:11,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:11,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579775979] [2020-02-10 20:12:11,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:11,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:11,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:11,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:11,980 INFO L87 Difference]: Start difference. First operand 449 states and 1533 transitions. Second operand 8 states. [2020-02-10 20:12:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:12,055 INFO L93 Difference]: Finished difference Result 871 states and 2698 transitions. [2020-02-10 20:12:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:12,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:12,057 INFO L225 Difference]: With dead ends: 871 [2020-02-10 20:12:12,058 INFO L226 Difference]: Without dead ends: 811 [2020-02-10 20:12:12,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-02-10 20:12:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 433. [2020-02-10 20:12:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-02-10 20:12:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1477 transitions. [2020-02-10 20:12:12,072 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1477 transitions. Word has length 19 [2020-02-10 20:12:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:12,072 INFO L479 AbstractCegarLoop]: Abstraction has 433 states and 1477 transitions. [2020-02-10 20:12:12,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1477 transitions. [2020-02-10 20:12:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:12,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:12,074 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:12,074 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:12,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:12,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1958633188, now seen corresponding path program 23 times [2020-02-10 20:12:12,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:12,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889555191] [2020-02-10 20:12:12,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:12,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889555191] [2020-02-10 20:12:12,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:12,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:12,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375211838] [2020-02-10 20:12:12,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:12,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:12,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:12,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:12,292 INFO L87 Difference]: Start difference. First operand 433 states and 1477 transitions. Second operand 8 states. [2020-02-10 20:12:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:12,393 INFO L93 Difference]: Finished difference Result 845 states and 2606 transitions. [2020-02-10 20:12:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:12,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:12,396 INFO L225 Difference]: With dead ends: 845 [2020-02-10 20:12:12,397 INFO L226 Difference]: Without dead ends: 808 [2020-02-10 20:12:12,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:12,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-02-10 20:12:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 441. [2020-02-10 20:12:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-02-10 20:12:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1497 transitions. [2020-02-10 20:12:12,413 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1497 transitions. Word has length 19 [2020-02-10 20:12:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:12,414 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 1497 transitions. [2020-02-10 20:12:12,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1497 transitions. [2020-02-10 20:12:12,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:12,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:12,416 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:12,416 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:12,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:12,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1099758658, now seen corresponding path program 24 times [2020-02-10 20:12:12,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:12,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080067975] [2020-02-10 20:12:12,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:12,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080067975] [2020-02-10 20:12:12,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:12,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:12,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111020974] [2020-02-10 20:12:12,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:12,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:12,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:12,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:12,642 INFO L87 Difference]: Start difference. First operand 441 states and 1497 transitions. Second operand 8 states. [2020-02-10 20:12:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:12,737 INFO L93 Difference]: Finished difference Result 852 states and 2624 transitions. [2020-02-10 20:12:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:12,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:12,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:12,740 INFO L225 Difference]: With dead ends: 852 [2020-02-10 20:12:12,740 INFO L226 Difference]: Without dead ends: 784 [2020-02-10 20:12:12,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-02-10 20:12:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 417. [2020-02-10 20:12:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-02-10 20:12:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1439 transitions. [2020-02-10 20:12:12,754 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1439 transitions. Word has length 19 [2020-02-10 20:12:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:12,755 INFO L479 AbstractCegarLoop]: Abstraction has 417 states and 1439 transitions. [2020-02-10 20:12:12,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1439 transitions. [2020-02-10 20:12:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:12,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:12,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:12,757 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:12,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:12,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1228367856, now seen corresponding path program 25 times [2020-02-10 20:12:12,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:12,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56768881] [2020-02-10 20:12:12,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:12,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56768881] [2020-02-10 20:12:12,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:12,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:12,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083420606] [2020-02-10 20:12:12,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:12,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:12,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:12,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:12,980 INFO L87 Difference]: Start difference. First operand 417 states and 1439 transitions. Second operand 8 states. [2020-02-10 20:12:13,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:13,049 INFO L93 Difference]: Finished difference Result 860 states and 2665 transitions. [2020-02-10 20:12:13,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:13,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:13,053 INFO L225 Difference]: With dead ends: 860 [2020-02-10 20:12:13,053 INFO L226 Difference]: Without dead ends: 822 [2020-02-10 20:12:13,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2020-02-10 20:12:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 446. [2020-02-10 20:12:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-02-10 20:12:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1534 transitions. [2020-02-10 20:12:13,070 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1534 transitions. Word has length 19 [2020-02-10 20:12:13,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:13,071 INFO L479 AbstractCegarLoop]: Abstraction has 446 states and 1534 transitions. [2020-02-10 20:12:13,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1534 transitions. [2020-02-10 20:12:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:13,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:13,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:13,073 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:13,073 INFO L82 PathProgramCache]: Analyzing trace with hash -853716670, now seen corresponding path program 26 times [2020-02-10 20:12:13,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:13,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355477946] [2020-02-10 20:12:13,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:13,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355477946] [2020-02-10 20:12:13,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:13,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:13,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052597664] [2020-02-10 20:12:13,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:13,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:13,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:13,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:13,352 INFO L87 Difference]: Start difference. First operand 446 states and 1534 transitions. Second operand 8 states. [2020-02-10 20:12:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:13,451 INFO L93 Difference]: Finished difference Result 870 states and 2692 transitions. [2020-02-10 20:12:13,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:13,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:13,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:13,455 INFO L225 Difference]: With dead ends: 870 [2020-02-10 20:12:13,455 INFO L226 Difference]: Without dead ends: 811 [2020-02-10 20:12:13,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-02-10 20:12:13,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 435. [2020-02-10 20:12:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-02-10 20:12:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1500 transitions. [2020-02-10 20:12:13,472 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1500 transitions. Word has length 19 [2020-02-10 20:12:13,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:13,472 INFO L479 AbstractCegarLoop]: Abstraction has 435 states and 1500 transitions. [2020-02-10 20:12:13,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1500 transitions. [2020-02-10 20:12:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:13,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:13,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:13,474 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:13,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:13,474 INFO L82 PathProgramCache]: Analyzing trace with hash -46978102, now seen corresponding path program 27 times [2020-02-10 20:12:13,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:13,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620772453] [2020-02-10 20:12:13,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:13,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620772453] [2020-02-10 20:12:13,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:13,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:13,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833484758] [2020-02-10 20:12:13,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:13,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:13,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:13,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:13,702 INFO L87 Difference]: Start difference. First operand 435 states and 1500 transitions. Second operand 8 states. [2020-02-10 20:12:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:13,768 INFO L93 Difference]: Finished difference Result 854 states and 2639 transitions. [2020-02-10 20:12:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:13,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:13,772 INFO L225 Difference]: With dead ends: 854 [2020-02-10 20:12:13,773 INFO L226 Difference]: Without dead ends: 816 [2020-02-10 20:12:13,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2020-02-10 20:12:13,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 444. [2020-02-10 20:12:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-02-10 20:12:13,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1521 transitions. [2020-02-10 20:12:13,788 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1521 transitions. Word has length 19 [2020-02-10 20:12:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:13,788 INFO L479 AbstractCegarLoop]: Abstraction has 444 states and 1521 transitions. [2020-02-10 20:12:13,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1521 transitions. [2020-02-10 20:12:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:13,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:13,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:13,790 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:13,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:13,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1023182852, now seen corresponding path program 28 times [2020-02-10 20:12:13,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:13,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078659550] [2020-02-10 20:12:13,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:14,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078659550] [2020-02-10 20:12:14,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:14,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:14,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476478478] [2020-02-10 20:12:14,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:14,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:14,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:14,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:14,011 INFO L87 Difference]: Start difference. First operand 444 states and 1521 transitions. Second operand 8 states. [2020-02-10 20:12:14,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:14,090 INFO L93 Difference]: Finished difference Result 860 states and 2655 transitions. [2020-02-10 20:12:14,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:14,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:14,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:14,093 INFO L225 Difference]: With dead ends: 860 [2020-02-10 20:12:14,093 INFO L226 Difference]: Without dead ends: 807 [2020-02-10 20:12:14,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:14,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2020-02-10 20:12:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 435. [2020-02-10 20:12:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-02-10 20:12:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1491 transitions. [2020-02-10 20:12:14,109 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1491 transitions. Word has length 19 [2020-02-10 20:12:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:14,109 INFO L479 AbstractCegarLoop]: Abstraction has 435 states and 1491 transitions. [2020-02-10 20:12:14,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1491 transitions. [2020-02-10 20:12:14,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:14,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:14,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:14,111 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:14,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:14,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1142789438, now seen corresponding path program 29 times [2020-02-10 20:12:14,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:14,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668386295] [2020-02-10 20:12:14,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:14,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668386295] [2020-02-10 20:12:14,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:14,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:14,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18808208] [2020-02-10 20:12:14,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:14,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:14,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:14,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:14,312 INFO L87 Difference]: Start difference. First operand 435 states and 1491 transitions. Second operand 8 states. [2020-02-10 20:12:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:14,403 INFO L93 Difference]: Finished difference Result 881 states and 2738 transitions. [2020-02-10 20:12:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:14,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:14,406 INFO L225 Difference]: With dead ends: 881 [2020-02-10 20:12:14,407 INFO L226 Difference]: Without dead ends: 833 [2020-02-10 20:12:14,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2020-02-10 20:12:14,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 451. [2020-02-10 20:12:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2020-02-10 20:12:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1539 transitions. [2020-02-10 20:12:14,420 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1539 transitions. Word has length 19 [2020-02-10 20:12:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:14,421 INFO L479 AbstractCegarLoop]: Abstraction has 451 states and 1539 transitions. [2020-02-10 20:12:14,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1539 transitions. [2020-02-10 20:12:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:14,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:14,422 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:14,423 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:14,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2001069322, now seen corresponding path program 30 times [2020-02-10 20:12:14,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:14,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226247939] [2020-02-10 20:12:14,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:14,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:14,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226247939] [2020-02-10 20:12:14,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:14,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:14,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778855232] [2020-02-10 20:12:14,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:14,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:14,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:14,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:14,658 INFO L87 Difference]: Start difference. First operand 451 states and 1539 transitions. Second operand 8 states. [2020-02-10 20:12:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:14,753 INFO L93 Difference]: Finished difference Result 877 states and 2710 transitions. [2020-02-10 20:12:14,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:14,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:14,757 INFO L225 Difference]: With dead ends: 877 [2020-02-10 20:12:14,757 INFO L226 Difference]: Without dead ends: 806 [2020-02-10 20:12:14,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2020-02-10 20:12:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 424. [2020-02-10 20:12:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-02-10 20:12:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1461 transitions. [2020-02-10 20:12:14,772 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1461 transitions. Word has length 19 [2020-02-10 20:12:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:14,772 INFO L479 AbstractCegarLoop]: Abstraction has 424 states and 1461 transitions. [2020-02-10 20:12:14,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1461 transitions. [2020-02-10 20:12:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:14,774 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:14,774 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:14,774 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:14,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:14,774 INFO L82 PathProgramCache]: Analyzing trace with hash 784001922, now seen corresponding path program 31 times [2020-02-10 20:12:14,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:14,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751850640] [2020-02-10 20:12:14,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:15,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751850640] [2020-02-10 20:12:15,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:15,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:15,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058909205] [2020-02-10 20:12:15,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:15,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:15,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:15,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:15,005 INFO L87 Difference]: Start difference. First operand 424 states and 1461 transitions. Second operand 8 states. [2020-02-10 20:12:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:15,069 INFO L93 Difference]: Finished difference Result 837 states and 2562 transitions. [2020-02-10 20:12:15,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:15,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:15,071 INFO L225 Difference]: With dead ends: 837 [2020-02-10 20:12:15,072 INFO L226 Difference]: Without dead ends: 799 [2020-02-10 20:12:15,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2020-02-10 20:12:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 441. [2020-02-10 20:12:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-02-10 20:12:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1506 transitions. [2020-02-10 20:12:15,083 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1506 transitions. Word has length 19 [2020-02-10 20:12:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:15,084 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 1506 transitions. [2020-02-10 20:12:15,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1506 transitions. [2020-02-10 20:12:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:15,085 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:15,085 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:15,085 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:15,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:15,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1158653108, now seen corresponding path program 32 times [2020-02-10 20:12:15,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:15,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954898725] [2020-02-10 20:12:15,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:15,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:15,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954898725] [2020-02-10 20:12:15,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:15,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:15,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202443124] [2020-02-10 20:12:15,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:15,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:15,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:15,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:15,304 INFO L87 Difference]: Start difference. First operand 441 states and 1506 transitions. Second operand 8 states. [2020-02-10 20:12:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:15,389 INFO L93 Difference]: Finished difference Result 847 states and 2589 transitions. [2020-02-10 20:12:15,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:15,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:15,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:15,391 INFO L225 Difference]: With dead ends: 847 [2020-02-10 20:12:15,392 INFO L226 Difference]: Without dead ends: 788 [2020-02-10 20:12:15,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2020-02-10 20:12:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 430. [2020-02-10 20:12:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-02-10 20:12:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1476 transitions. [2020-02-10 20:12:15,405 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1476 transitions. Word has length 19 [2020-02-10 20:12:15,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:15,405 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 1476 transitions. [2020-02-10 20:12:15,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1476 transitions. [2020-02-10 20:12:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:15,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:15,407 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:15,407 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:15,407 INFO L82 PathProgramCache]: Analyzing trace with hash 988603004, now seen corresponding path program 33 times [2020-02-10 20:12:15,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:15,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359155309] [2020-02-10 20:12:15,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:15,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359155309] [2020-02-10 20:12:15,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:15,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:15,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214086255] [2020-02-10 20:12:15,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:15,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:15,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:15,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:15,618 INFO L87 Difference]: Start difference. First operand 430 states and 1476 transitions. Second operand 8 states. [2020-02-10 20:12:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:15,682 INFO L93 Difference]: Finished difference Result 820 states and 2498 transitions. [2020-02-10 20:12:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:15,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:15,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:15,685 INFO L225 Difference]: With dead ends: 820 [2020-02-10 20:12:15,685 INFO L226 Difference]: Without dead ends: 782 [2020-02-10 20:12:15,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:15,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2020-02-10 20:12:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 435. [2020-02-10 20:12:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-02-10 20:12:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1485 transitions. [2020-02-10 20:12:15,699 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1485 transitions. Word has length 19 [2020-02-10 20:12:15,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:15,699 INFO L479 AbstractCegarLoop]: Abstraction has 435 states and 1485 transitions. [2020-02-10 20:12:15,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1485 transitions. [2020-02-10 20:12:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:15,700 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:15,701 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:15,701 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:15,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:15,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1865254260, now seen corresponding path program 1 times [2020-02-10 20:12:15,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:15,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089203595] [2020-02-10 20:12:15,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:15,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089203595] [2020-02-10 20:12:15,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:15,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:15,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855795764] [2020-02-10 20:12:15,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:15,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:15,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:15,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:15,721 INFO L87 Difference]: Start difference. First operand 435 states and 1485 transitions. Second operand 3 states. [2020-02-10 20:12:15,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:15,741 INFO L93 Difference]: Finished difference Result 349 states and 1112 transitions. [2020-02-10 20:12:15,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:15,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-02-10 20:12:15,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:15,742 INFO L225 Difference]: With dead ends: 349 [2020-02-10 20:12:15,742 INFO L226 Difference]: Without dead ends: 349 [2020-02-10 20:12:15,742 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:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-02-10 20:12:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2020-02-10 20:12:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:12:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1112 transitions. [2020-02-10 20:12:15,752 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1112 transitions. Word has length 19 [2020-02-10 20:12:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:15,752 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1112 transitions. [2020-02-10 20:12:15,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:15,753 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1112 transitions. [2020-02-10 20:12:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:15,754 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:15,754 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:15,754 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:15,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:15,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1163123542, now seen corresponding path program 34 times [2020-02-10 20:12:15,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:15,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172646982] [2020-02-10 20:12:15,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:15,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172646982] [2020-02-10 20:12:15,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:15,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:15,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395253782] [2020-02-10 20:12:15,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:15,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:15,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:15,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:15,988 INFO L87 Difference]: Start difference. First operand 349 states and 1112 transitions. Second operand 8 states. [2020-02-10 20:12:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:16,070 INFO L93 Difference]: Finished difference Result 644 states and 1770 transitions. [2020-02-10 20:12:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:16,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:16,072 INFO L225 Difference]: With dead ends: 644 [2020-02-10 20:12:16,072 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 20:12:16,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 20:12:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 346. [2020-02-10 20:12:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:12:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1105 transitions. [2020-02-10 20:12:16,083 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1105 transitions. Word has length 19 [2020-02-10 20:12:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:16,083 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1105 transitions. [2020-02-10 20:12:16,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1105 transitions. [2020-02-10 20:12:16,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:16,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:16,084 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:16,085 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:16,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:16,085 INFO L82 PathProgramCache]: Analyzing trace with hash -409413030, now seen corresponding path program 35 times [2020-02-10 20:12:16,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:16,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812352233] [2020-02-10 20:12:16,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:16,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812352233] [2020-02-10 20:12:16,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:16,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:16,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726305653] [2020-02-10 20:12:16,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:16,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:16,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:16,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:16,273 INFO L87 Difference]: Start difference. First operand 346 states and 1105 transitions. Second operand 8 states. [2020-02-10 20:12:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:16,363 INFO L93 Difference]: Finished difference Result 666 states and 1842 transitions. [2020-02-10 20:12:16,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:16,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:16,365 INFO L225 Difference]: With dead ends: 666 [2020-02-10 20:12:16,365 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 20:12:16,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 20:12:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 352. [2020-02-10 20:12:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 20:12:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1117 transitions. [2020-02-10 20:12:16,376 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1117 transitions. Word has length 19 [2020-02-10 20:12:16,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:16,377 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1117 transitions. [2020-02-10 20:12:16,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1117 transitions. [2020-02-10 20:12:16,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:16,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:16,378 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:16,378 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:16,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1283748356, now seen corresponding path program 36 times [2020-02-10 20:12:16,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:16,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149462110] [2020-02-10 20:12:16,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:16,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149462110] [2020-02-10 20:12:16,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:16,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:16,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139666966] [2020-02-10 20:12:16,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:16,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:16,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:16,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:16,648 INFO L87 Difference]: Start difference. First operand 352 states and 1117 transitions. Second operand 8 states. [2020-02-10 20:12:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:16,739 INFO L93 Difference]: Finished difference Result 656 states and 1805 transitions. [2020-02-10 20:12:16,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:16,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:16,741 INFO L225 Difference]: With dead ends: 656 [2020-02-10 20:12:16,742 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 20:12:16,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 20:12:16,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 342. [2020-02-10 20:12:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-02-10 20:12:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1096 transitions. [2020-02-10 20:12:16,754 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1096 transitions. Word has length 19 [2020-02-10 20:12:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:16,754 INFO L479 AbstractCegarLoop]: Abstraction has 342 states and 1096 transitions. [2020-02-10 20:12:16,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1096 transitions. [2020-02-10 20:12:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:16,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:16,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:16,756 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:16,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1043020286, now seen corresponding path program 37 times [2020-02-10 20:12:16,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:16,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413623775] [2020-02-10 20:12:16,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:16,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413623775] [2020-02-10 20:12:16,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:16,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:16,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40817095] [2020-02-10 20:12:16,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:16,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:16,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:16,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:16,959 INFO L87 Difference]: Start difference. First operand 342 states and 1096 transitions. Second operand 8 states. [2020-02-10 20:12:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:17,027 INFO L93 Difference]: Finished difference Result 637 states and 1753 transitions. [2020-02-10 20:12:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:17,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:17,029 INFO L225 Difference]: With dead ends: 637 [2020-02-10 20:12:17,029 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:12:17,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:17,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:12:17,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 348. [2020-02-10 20:12:17,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 20:12:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1110 transitions. [2020-02-10 20:12:17,040 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1110 transitions. Word has length 19 [2020-02-10 20:12:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:17,041 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1110 transitions. [2020-02-10 20:12:17,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1110 transitions. [2020-02-10 20:12:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:17,042 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:17,042 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:17,042 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:17,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1100220464, now seen corresponding path program 38 times [2020-02-10 20:12:17,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:17,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228993308] [2020-02-10 20:12:17,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:17,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228993308] [2020-02-10 20:12:17,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:17,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:17,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409781528] [2020-02-10 20:12:17,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:17,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:17,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:17,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:17,219 INFO L87 Difference]: Start difference. First operand 348 states and 1110 transitions. Second operand 8 states. [2020-02-10 20:12:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:17,299 INFO L93 Difference]: Finished difference Result 636 states and 1749 transitions. [2020-02-10 20:12:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:17,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:17,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:17,300 INFO L225 Difference]: With dead ends: 636 [2020-02-10 20:12:17,301 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 20:12:17,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:17,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 20:12:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 345. [2020-02-10 20:12:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:12:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-02-10 20:12:17,313 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-02-10 20:12:17,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:17,313 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-02-10 20:12:17,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-02-10 20:12:17,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:17,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:17,315 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:17,315 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:17,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1549366552, now seen corresponding path program 39 times [2020-02-10 20:12:17,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:17,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489687654] [2020-02-10 20:12:17,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:17,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489687654] [2020-02-10 20:12:17,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:17,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:17,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491540276] [2020-02-10 20:12:17,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:17,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:17,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:17,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:17,523 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-02-10 20:12:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:17,592 INFO L93 Difference]: Finished difference Result 646 states and 1779 transitions. [2020-02-10 20:12:17,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:17,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:17,594 INFO L225 Difference]: With dead ends: 646 [2020-02-10 20:12:17,594 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:12:17,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:17,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:12:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 351. [2020-02-10 20:12:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 20:12:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1114 transitions. [2020-02-10 20:12:17,602 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1114 transitions. Word has length 19 [2020-02-10 20:12:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:17,602 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1114 transitions. [2020-02-10 20:12:17,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1114 transitions. [2020-02-10 20:12:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:17,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:17,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:17,603 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:17,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1769395994, now seen corresponding path program 40 times [2020-02-10 20:12:17,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:17,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932399481] [2020-02-10 20:12:17,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:17,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932399481] [2020-02-10 20:12:17,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:17,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:17,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743001536] [2020-02-10 20:12:17,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:17,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:17,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:17,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:17,820 INFO L87 Difference]: Start difference. First operand 351 states and 1114 transitions. Second operand 8 states. [2020-02-10 20:12:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:17,904 INFO L93 Difference]: Finished difference Result 651 states and 1791 transitions. [2020-02-10 20:12:17,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:17,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:17,906 INFO L225 Difference]: With dead ends: 651 [2020-02-10 20:12:17,906 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:12:17,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:17,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:12:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 345. [2020-02-10 20:12:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:12:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1100 transitions. [2020-02-10 20:12:17,918 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1100 transitions. Word has length 19 [2020-02-10 20:12:17,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:17,918 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1100 transitions. [2020-02-10 20:12:17,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1100 transitions. [2020-02-10 20:12:17,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:17,919 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:17,919 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:17,920 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:17,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:17,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1215861966, now seen corresponding path program 41 times [2020-02-10 20:12:17,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:17,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186993236] [2020-02-10 20:12:17,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:18,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186993236] [2020-02-10 20:12:18,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:18,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:18,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466110848] [2020-02-10 20:12:18,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:18,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:18,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:18,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:18,148 INFO L87 Difference]: Start difference. First operand 345 states and 1100 transitions. Second operand 8 states. [2020-02-10 20:12:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:18,254 INFO L93 Difference]: Finished difference Result 643 states and 1772 transitions. [2020-02-10 20:12:18,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:18,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:18,255 INFO L225 Difference]: With dead ends: 643 [2020-02-10 20:12:18,255 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 20:12:18,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 20:12:18,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 350. [2020-02-10 20:12:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 20:12:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1110 transitions. [2020-02-10 20:12:18,266 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1110 transitions. Word has length 19 [2020-02-10 20:12:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:18,267 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1110 transitions. [2020-02-10 20:12:18,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1110 transitions. [2020-02-10 20:12:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:18,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:18,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:18,268 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:18,269 INFO L82 PathProgramCache]: Analyzing trace with hash -513185368, now seen corresponding path program 42 times [2020-02-10 20:12:18,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:18,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57868913] [2020-02-10 20:12:18,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:18,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57868913] [2020-02-10 20:12:18,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:18,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:18,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005534978] [2020-02-10 20:12:18,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:18,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:18,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:18,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:18,466 INFO L87 Difference]: Start difference. First operand 350 states and 1110 transitions. Second operand 8 states. [2020-02-10 20:12:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:18,558 INFO L93 Difference]: Finished difference Result 649 states and 1786 transitions. [2020-02-10 20:12:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:18,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:18,559 INFO L225 Difference]: With dead ends: 649 [2020-02-10 20:12:18,560 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 20:12:18,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 20:12:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 342. [2020-02-10 20:12:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-02-10 20:12:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1093 transitions. [2020-02-10 20:12:18,568 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1093 transitions. Word has length 19 [2020-02-10 20:12:18,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:18,568 INFO L479 AbstractCegarLoop]: Abstraction has 342 states and 1093 transitions. [2020-02-10 20:12:18,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:18,568 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1093 transitions. [2020-02-10 20:12:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:18,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:18,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:18,569 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:18,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:18,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1822419634, now seen corresponding path program 43 times [2020-02-10 20:12:18,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:18,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806598244] [2020-02-10 20:12:18,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:18,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806598244] [2020-02-10 20:12:18,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:18,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:18,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28318297] [2020-02-10 20:12:18,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:18,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:18,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:18,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:18,751 INFO L87 Difference]: Start difference. First operand 342 states and 1093 transitions. Second operand 8 states. [2020-02-10 20:12:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:18,834 INFO L93 Difference]: Finished difference Result 678 states and 1898 transitions. [2020-02-10 20:12:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:18,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:18,836 INFO L225 Difference]: With dead ends: 678 [2020-02-10 20:12:18,836 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 20:12:18,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 20:12:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 353. [2020-02-10 20:12:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-02-10 20:12:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1125 transitions. [2020-02-10 20:12:18,845 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1125 transitions. Word has length 19 [2020-02-10 20:12:18,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:18,846 INFO L479 AbstractCegarLoop]: Abstraction has 353 states and 1125 transitions. [2020-02-10 20:12:18,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1125 transitions. [2020-02-10 20:12:18,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:18,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:18,847 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:18,847 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:18,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:18,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1598212336, now seen corresponding path program 44 times [2020-02-10 20:12:18,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:18,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066892835] [2020-02-10 20:12:18,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066892835] [2020-02-10 20:12:19,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:19,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716531274] [2020-02-10 20:12:19,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:19,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:19,024 INFO L87 Difference]: Start difference. First operand 353 states and 1125 transitions. Second operand 8 states. [2020-02-10 20:12:19,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:19,106 INFO L93 Difference]: Finished difference Result 668 states and 1861 transitions. [2020-02-10 20:12:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:19,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:19,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:19,108 INFO L225 Difference]: With dead ends: 668 [2020-02-10 20:12:19,108 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 20:12:19,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:19,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 20:12:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 347. [2020-02-10 20:12:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:12:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1108 transitions. [2020-02-10 20:12:19,119 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1108 transitions. Word has length 19 [2020-02-10 20:12:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:19,120 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1108 transitions. [2020-02-10 20:12:19,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1108 transitions. [2020-02-10 20:12:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:19,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:19,121 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:19,121 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:19,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:19,121 INFO L82 PathProgramCache]: Analyzing trace with hash 411687860, now seen corresponding path program 45 times [2020-02-10 20:12:19,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:19,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258430015] [2020-02-10 20:12:19,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258430015] [2020-02-10 20:12:19,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:19,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926560338] [2020-02-10 20:12:19,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:19,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:19,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:19,326 INFO L87 Difference]: Start difference. First operand 347 states and 1108 transitions. Second operand 8 states. [2020-02-10 20:12:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:19,406 INFO L93 Difference]: Finished difference Result 690 states and 1937 transitions. [2020-02-10 20:12:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:19,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:19,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:19,408 INFO L225 Difference]: With dead ends: 690 [2020-02-10 20:12:19,408 INFO L226 Difference]: Without dead ends: 650 [2020-02-10 20:12:19,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:19,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-02-10 20:12:19,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 359. [2020-02-10 20:12:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-02-10 20:12:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1139 transitions. [2020-02-10 20:12:19,416 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1139 transitions. Word has length 19 [2020-02-10 20:12:19,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:19,416 INFO L479 AbstractCegarLoop]: Abstraction has 359 states and 1139 transitions. [2020-02-10 20:12:19,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1139 transitions. [2020-02-10 20:12:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:19,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:19,417 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:19,418 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:19,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:19,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1380571900, now seen corresponding path program 46 times [2020-02-10 20:12:19,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:19,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721264065] [2020-02-10 20:12:19,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721264065] [2020-02-10 20:12:19,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:19,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624925953] [2020-02-10 20:12:19,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:19,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:19,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:19,626 INFO L87 Difference]: Start difference. First operand 359 states and 1139 transitions. Second operand 8 states. [2020-02-10 20:12:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:19,720 INFO L93 Difference]: Finished difference Result 686 states and 1913 transitions. [2020-02-10 20:12:19,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:19,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:19,722 INFO L225 Difference]: With dead ends: 686 [2020-02-10 20:12:19,723 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 20:12:19,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 20:12:19,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 347. [2020-02-10 20:12:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:12:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1103 transitions. [2020-02-10 20:12:19,733 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1103 transitions. Word has length 19 [2020-02-10 20:12:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:19,733 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1103 transitions. [2020-02-10 20:12:19,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1103 transitions. [2020-02-10 20:12:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:19,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:19,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:19,735 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1771460028, now seen corresponding path program 47 times [2020-02-10 20:12:19,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:19,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165879521] [2020-02-10 20:12:19,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165879521] [2020-02-10 20:12:19,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:19,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189827614] [2020-02-10 20:12:19,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:19,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:19,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:19,912 INFO L87 Difference]: Start difference. First operand 347 states and 1103 transitions. Second operand 8 states. [2020-02-10 20:12:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:20,004 INFO L93 Difference]: Finished difference Result 663 states and 1842 transitions. [2020-02-10 20:12:20,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:20,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:20,006 INFO L225 Difference]: With dead ends: 663 [2020-02-10 20:12:20,007 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 20:12:20,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:20,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 20:12:20,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 352. [2020-02-10 20:12:20,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 20:12:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1113 transitions. [2020-02-10 20:12:20,016 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1113 transitions. Word has length 19 [2020-02-10 20:12:20,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:20,016 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1113 transitions. [2020-02-10 20:12:20,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:20,016 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1113 transitions. [2020-02-10 20:12:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:20,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:20,017 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:20,017 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:20,017 INFO L82 PathProgramCache]: Analyzing trace with hash 42412694, now seen corresponding path program 48 times [2020-02-10 20:12:20,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:20,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510947307] [2020-02-10 20:12:20,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:20,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510947307] [2020-02-10 20:12:20,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:20,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:20,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504867603] [2020-02-10 20:12:20,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:20,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:20,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:20,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:20,223 INFO L87 Difference]: Start difference. First operand 352 states and 1113 transitions. Second operand 8 states. [2020-02-10 20:12:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:20,324 INFO L93 Difference]: Finished difference Result 669 states and 1856 transitions. [2020-02-10 20:12:20,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:20,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:20,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:20,326 INFO L225 Difference]: With dead ends: 669 [2020-02-10 20:12:20,326 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:12:20,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:12:20,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 337. [2020-02-10 20:12:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-02-10 20:12:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1082 transitions. [2020-02-10 20:12:20,339 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1082 transitions. Word has length 19 [2020-02-10 20:12:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:20,339 INFO L479 AbstractCegarLoop]: Abstraction has 337 states and 1082 transitions. [2020-02-10 20:12:20,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1082 transitions. [2020-02-10 20:12:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:20,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:20,341 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:20,341 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:20,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:20,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1950102064, now seen corresponding path program 49 times [2020-02-10 20:12:20,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:20,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438565962] [2020-02-10 20:12:20,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:20,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438565962] [2020-02-10 20:12:20,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:20,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:20,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551774289] [2020-02-10 20:12:20,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:20,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:20,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:20,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:20,570 INFO L87 Difference]: Start difference. First operand 337 states and 1082 transitions. Second operand 8 states. [2020-02-10 20:12:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:20,645 INFO L93 Difference]: Finished difference Result 648 states and 1785 transitions. [2020-02-10 20:12:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:20,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:20,646 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:12:20,647 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:12:20,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:20,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:12:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 353. [2020-02-10 20:12:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-02-10 20:12:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1124 transitions. [2020-02-10 20:12:20,657 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1124 transitions. Word has length 19 [2020-02-10 20:12:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:20,657 INFO L479 AbstractCegarLoop]: Abstraction has 353 states and 1124 transitions. [2020-02-10 20:12:20,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1124 transitions. [2020-02-10 20:12:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:20,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:20,659 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:20,659 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:20,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:20,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1575450878, now seen corresponding path program 50 times [2020-02-10 20:12:20,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:20,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635568302] [2020-02-10 20:12:20,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:20,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635568302] [2020-02-10 20:12:20,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:20,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:20,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686684600] [2020-02-10 20:12:20,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:20,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:20,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:20,874 INFO L87 Difference]: Start difference. First operand 353 states and 1124 transitions. Second operand 8 states. [2020-02-10 20:12:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:20,956 INFO L93 Difference]: Finished difference Result 657 states and 1808 transitions. [2020-02-10 20:12:20,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:20,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:20,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:20,957 INFO L225 Difference]: With dead ends: 657 [2020-02-10 20:12:20,958 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:12:20,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:20,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:12:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 345. [2020-02-10 20:12:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:12:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1106 transitions. [2020-02-10 20:12:20,968 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1106 transitions. Word has length 19 [2020-02-10 20:12:20,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:20,968 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1106 transitions. [2020-02-10 20:12:20,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1106 transitions. [2020-02-10 20:12:20,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:20,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:20,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:20,969 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:20,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1745500982, now seen corresponding path program 51 times [2020-02-10 20:12:20,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:20,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328896113] [2020-02-10 20:12:20,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:21,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:21,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328896113] [2020-02-10 20:12:21,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:21,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:21,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111275059] [2020-02-10 20:12:21,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:21,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:21,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:21,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:21,190 INFO L87 Difference]: Start difference. First operand 345 states and 1106 transitions. Second operand 8 states. [2020-02-10 20:12:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:21,259 INFO L93 Difference]: Finished difference Result 633 states and 1736 transitions. [2020-02-10 20:12:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:21,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:21,261 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:12:21,261 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:12:21,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:12:21,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 348. [2020-02-10 20:12:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 20:12:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1110 transitions. [2020-02-10 20:12:21,270 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1110 transitions. Word has length 19 [2020-02-10 20:12:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:21,270 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1110 transitions. [2020-02-10 20:12:21,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1110 transitions. [2020-02-10 20:12:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:21,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:21,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:21,271 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:21,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:21,272 INFO L82 PathProgramCache]: Analyzing trace with hash 397739768, now seen corresponding path program 52 times [2020-02-10 20:12:21,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:21,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907210535] [2020-02-10 20:12:21,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:21,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907210535] [2020-02-10 20:12:21,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:21,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:21,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253341151] [2020-02-10 20:12:21,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:21,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:21,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:21,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:21,501 INFO L87 Difference]: Start difference. First operand 348 states and 1110 transitions. Second operand 8 states. [2020-02-10 20:12:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:21,583 INFO L93 Difference]: Finished difference Result 632 states and 1732 transitions. [2020-02-10 20:12:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:21,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:21,586 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:12:21,587 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 20:12:21,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:21,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 20:12:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 345. [2020-02-10 20:12:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:12:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-02-10 20:12:21,597 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-02-10 20:12:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:21,597 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-02-10 20:12:21,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-02-10 20:12:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:21,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:21,598 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:21,598 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:21,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1151450280, now seen corresponding path program 53 times [2020-02-10 20:12:21,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:21,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931346339] [2020-02-10 20:12:21,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:21,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931346339] [2020-02-10 20:12:21,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:21,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:21,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551376738] [2020-02-10 20:12:21,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:21,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:21,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:21,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:21,797 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-02-10 20:12:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:21,872 INFO L93 Difference]: Finished difference Result 654 states and 1804 transitions. [2020-02-10 20:12:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:21,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:21,874 INFO L225 Difference]: With dead ends: 654 [2020-02-10 20:12:21,874 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:12:21,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:12:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 351. [2020-02-10 20:12:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 20:12:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1115 transitions. [2020-02-10 20:12:21,884 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1115 transitions. Word has length 19 [2020-02-10 20:12:21,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:21,884 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1115 transitions. [2020-02-10 20:12:21,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1115 transitions. [2020-02-10 20:12:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:21,886 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:21,886 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:21,886 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash 277114954, now seen corresponding path program 54 times [2020-02-10 20:12:21,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:21,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429278438] [2020-02-10 20:12:21,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,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:22,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429278438] [2020-02-10 20:12:22,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:22,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492266438] [2020-02-10 20:12:22,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:22,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:22,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:22,078 INFO L87 Difference]: Start difference. First operand 351 states and 1115 transitions. Second operand 8 states. [2020-02-10 20:12:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,170 INFO L93 Difference]: Finished difference Result 644 states and 1767 transitions. [2020-02-10 20:12:22,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:22,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:22,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,172 INFO L225 Difference]: With dead ends: 644 [2020-02-10 20:12:22,172 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 20:12:22,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 20:12:22,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 341. [2020-02-10 20:12:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:12:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1094 transitions. [2020-02-10 20:12:22,179 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1094 transitions. Word has length 19 [2020-02-10 20:12:22,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,180 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1094 transitions. [2020-02-10 20:12:22,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1094 transitions. [2020-02-10 20:12:22,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:22,180 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,181 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:22,181 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1499893780, now seen corresponding path program 55 times [2020-02-10 20:12:22,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045748826] [2020-02-10 20:12:22,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:22,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045748826] [2020-02-10 20:12:22,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:22,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452357829] [2020-02-10 20:12:22,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:22,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:22,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:22,399 INFO L87 Difference]: Start difference. First operand 341 states and 1094 transitions. Second operand 8 states. [2020-02-10 20:12:22,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,474 INFO L93 Difference]: Finished difference Result 658 states and 1820 transitions. [2020-02-10 20:12:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:22,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:22,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,476 INFO L225 Difference]: With dead ends: 658 [2020-02-10 20:12:22,476 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 20:12:22,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:22,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 20:12:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 355. [2020-02-10 20:12:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-02-10 20:12:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1129 transitions. [2020-02-10 20:12:22,486 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1129 transitions. Word has length 19 [2020-02-10 20:12:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,486 INFO L479 AbstractCegarLoop]: Abstraction has 355 states and 1129 transitions. [2020-02-10 20:12:22,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1129 transitions. [2020-02-10 20:12:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:22,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:22,487 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1874544966, now seen corresponding path program 56 times [2020-02-10 20:12:22,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584784576] [2020-02-10 20:12:22,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,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:22,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584784576] [2020-02-10 20:12:22,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:22,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060369278] [2020-02-10 20:12:22,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:22,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:22,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:22,721 INFO L87 Difference]: Start difference. First operand 355 states and 1129 transitions. Second operand 8 states. [2020-02-10 20:12:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,804 INFO L93 Difference]: Finished difference Result 667 states and 1843 transitions. [2020-02-10 20:12:22,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:22,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:22,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,806 INFO L225 Difference]: With dead ends: 667 [2020-02-10 20:12:22,806 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:12:22,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:22,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:12:22,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 347. [2020-02-10 20:12:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:12:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1109 transitions. [2020-02-10 20:12:22,816 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1109 transitions. Word has length 19 [2020-02-10 20:12:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,816 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1109 transitions. [2020-02-10 20:12:22,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1109 transitions. [2020-02-10 20:12:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:22,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,817 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:22,817 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1939279986, now seen corresponding path program 57 times [2020-02-10 20:12:22,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008768840] [2020-02-10 20:12:22,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:23,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008768840] [2020-02-10 20:12:23,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:23,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830258137] [2020-02-10 20:12:23,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:23,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:23,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:23,057 INFO L87 Difference]: Start difference. First operand 347 states and 1109 transitions. Second operand 8 states. [2020-02-10 20:12:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:23,116 INFO L93 Difference]: Finished difference Result 648 states and 1786 transitions. [2020-02-10 20:12:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:23,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:23,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:23,118 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:12:23,118 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:12:23,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:12:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 352. [2020-02-10 20:12:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 20:12:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1118 transitions. [2020-02-10 20:12:23,126 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1118 transitions. Word has length 19 [2020-02-10 20:12:23,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:23,126 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1118 transitions. [2020-02-10 20:12:23,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:23,126 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1118 transitions. [2020-02-10 20:12:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:23,127 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:23,127 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:23,127 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:23,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:23,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1604625216, now seen corresponding path program 58 times [2020-02-10 20:12:23,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:23,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233173278] [2020-02-10 20:12:23,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:23,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233173278] [2020-02-10 20:12:23,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:23,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824701667] [2020-02-10 20:12:23,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:23,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:23,327 INFO L87 Difference]: Start difference. First operand 352 states and 1118 transitions. Second operand 8 states. [2020-02-10 20:12:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:23,410 INFO L93 Difference]: Finished difference Result 650 states and 1790 transitions. [2020-02-10 20:12:23,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:23,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:23,412 INFO L225 Difference]: With dead ends: 650 [2020-02-10 20:12:23,412 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:12:23,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:23,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:12:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 347. [2020-02-10 20:12:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:12:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1104 transitions. [2020-02-10 20:12:23,420 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1104 transitions. Word has length 19 [2020-02-10 20:12:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:23,420 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1104 transitions. [2020-02-10 20:12:23,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1104 transitions. [2020-02-10 20:12:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:23,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:23,421 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:23,421 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:23,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash 334504740, now seen corresponding path program 59 times [2020-02-10 20:12:23,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:23,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956718066] [2020-02-10 20:12:23,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:23,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956718066] [2020-02-10 20:12:23,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:23,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171854557] [2020-02-10 20:12:23,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:23,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:23,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:23,625 INFO L87 Difference]: Start difference. First operand 347 states and 1104 transitions. Second operand 8 states. [2020-02-10 20:12:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:23,722 INFO L93 Difference]: Finished difference Result 670 states and 1858 transitions. [2020-02-10 20:12:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:23,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:23,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:23,724 INFO L225 Difference]: With dead ends: 670 [2020-02-10 20:12:23,725 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 20:12:23,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 20:12:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 356. [2020-02-10 20:12:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2020-02-10 20:12:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1126 transitions. [2020-02-10 20:12:23,733 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 1126 transitions. Word has length 19 [2020-02-10 20:12:23,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:23,733 INFO L479 AbstractCegarLoop]: Abstraction has 356 states and 1126 transitions. [2020-02-10 20:12:23,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 1126 transitions. [2020-02-10 20:12:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:23,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:23,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:23,734 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:23,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:23,734 INFO L82 PathProgramCache]: Analyzing trace with hash 333910094, now seen corresponding path program 60 times [2020-02-10 20:12:23,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:23,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622842168] [2020-02-10 20:12:23,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:23,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622842168] [2020-02-10 20:12:23,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:23,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830632786] [2020-02-10 20:12:23,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:23,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:23,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:23,937 INFO L87 Difference]: Start difference. First operand 356 states and 1126 transitions. Second operand 8 states. [2020-02-10 20:12:24,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,043 INFO L93 Difference]: Finished difference Result 663 states and 1828 transitions. [2020-02-10 20:12:24,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:24,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,045 INFO L225 Difference]: With dead ends: 663 [2020-02-10 20:12:24,045 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:12:24,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:12:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 341. [2020-02-10 20:12:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:12:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1090 transitions. [2020-02-10 20:12:24,053 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1090 transitions. Word has length 19 [2020-02-10 20:12:24,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,053 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1090 transitions. [2020-02-10 20:12:24,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1090 transitions. [2020-02-10 20:12:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:24,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:24,054 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,054 INFO L82 PathProgramCache]: Analyzing trace with hash -985705328, now seen corresponding path program 61 times [2020-02-10 20:12:24,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339524201] [2020-02-10 20:12:24,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:24,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339524201] [2020-02-10 20:12:24,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:24,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:24,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713500987] [2020-02-10 20:12:24,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:24,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:24,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:24,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:24,271 INFO L87 Difference]: Start difference. First operand 341 states and 1090 transitions. Second operand 8 states. [2020-02-10 20:12:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,340 INFO L93 Difference]: Finished difference Result 620 states and 1696 transitions. [2020-02-10 20:12:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:24,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,341 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:12:24,342 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:12:24,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:12:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 347. [2020-02-10 20:12:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:12:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1104 transitions. [2020-02-10 20:12:24,351 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1104 transitions. Word has length 19 [2020-02-10 20:12:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,351 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1104 transitions. [2020-02-10 20:12:24,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1104 transitions. [2020-02-10 20:12:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:24,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:24,353 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1157535422, now seen corresponding path program 62 times [2020-02-10 20:12:24,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841341620] [2020-02-10 20:12:24,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:24,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841341620] [2020-02-10 20:12:24,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:24,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:24,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43765158] [2020-02-10 20:12:24,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:24,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:24,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:24,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:24,565 INFO L87 Difference]: Start difference. First operand 347 states and 1104 transitions. Second operand 8 states. [2020-02-10 20:12:24,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,659 INFO L93 Difference]: Finished difference Result 619 states and 1692 transitions. [2020-02-10 20:12:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:24,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:24,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,661 INFO L225 Difference]: With dead ends: 619 [2020-02-10 20:12:24,661 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:12:24,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:12:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 344. [2020-02-10 20:12:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 20:12:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1097 transitions. [2020-02-10 20:12:24,669 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1097 transitions. Word has length 19 [2020-02-10 20:12:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,669 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1097 transitions. [2020-02-10 20:12:24,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:24,670 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1097 transitions. [2020-02-10 20:12:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:24,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,670 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:24,670 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,671 INFO L82 PathProgramCache]: Analyzing trace with hash 108386260, now seen corresponding path program 63 times [2020-02-10 20:12:24,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246040562] [2020-02-10 20:12:24,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:24,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:24,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246040562] [2020-02-10 20:12:24,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:24,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:24,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190955646] [2020-02-10 20:12:24,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:24,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:24,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:24,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:24,893 INFO L87 Difference]: Start difference. First operand 344 states and 1097 transitions. Second operand 8 states. [2020-02-10 20:12:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,951 INFO L93 Difference]: Finished difference Result 625 states and 1710 transitions. [2020-02-10 20:12:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:24,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,953 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:12:24,953 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 20:12:24,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 20:12:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 349. [2020-02-10 20:12:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:12:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1106 transitions. [2020-02-10 20:12:24,960 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1106 transitions. Word has length 19 [2020-02-10 20:12:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,960 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1106 transitions. [2020-02-10 20:12:24,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1106 transitions. [2020-02-10 20:12:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:24,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:24,961 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash -642675834, now seen corresponding path program 64 times [2020-02-10 20:12:24,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519522684] [2020-02-10 20:12:24,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,155 INFO L134 CoverageAnalysis]: 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,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519522684] [2020-02-10 20:12:25,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:25,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216550417] [2020-02-10 20:12:25,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:25,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:25,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:25,158 INFO L87 Difference]: Start difference. First operand 349 states and 1106 transitions. Second operand 8 states. [2020-02-10 20:12:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:25,251 INFO L93 Difference]: Finished difference Result 627 states and 1714 transitions. [2020-02-10 20:12:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:25,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:25,253 INFO L225 Difference]: With dead ends: 627 [2020-02-10 20:12:25,254 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 20:12:25,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 20:12:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 344. [2020-02-10 20:12:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 20:12:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1094 transitions. [2020-02-10 20:12:25,263 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1094 transitions. Word has length 19 [2020-02-10 20:12:25,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:25,263 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1094 transitions. [2020-02-10 20:12:25,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1094 transitions. [2020-02-10 20:12:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:25,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:25,264 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:25,265 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:25,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash 517971322, now seen corresponding path program 65 times [2020-02-10 20:12:25,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:25,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50203864] [2020-02-10 20:12:25,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:25,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50203864] [2020-02-10 20:12:25,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:25,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593178672] [2020-02-10 20:12:25,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:25,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:25,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:25,540 INFO L87 Difference]: Start difference. First operand 344 states and 1094 transitions. Second operand 8 states. [2020-02-10 20:12:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:25,649 INFO L93 Difference]: Finished difference Result 622 states and 1703 transitions. [2020-02-10 20:12:25,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:25,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:25,651 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:12:25,651 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:12:25,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:12:25,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 348. [2020-02-10 20:12:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 20:12:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1102 transitions. [2020-02-10 20:12:25,666 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1102 transitions. Word has length 19 [2020-02-10 20:12:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:25,666 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1102 transitions. [2020-02-10 20:12:25,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1102 transitions. [2020-02-10 20:12:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:25,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:25,669 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:25,669 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2066382666, now seen corresponding path program 66 times [2020-02-10 20:12:25,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:25,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743803198] [2020-02-10 20:12:25,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:25,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743803198] [2020-02-10 20:12:25,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:25,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579637459] [2020-02-10 20:12:25,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:25,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:25,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:25,907 INFO L87 Difference]: Start difference. First operand 348 states and 1102 transitions. Second operand 8 states. [2020-02-10 20:12:25,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:25,986 INFO L93 Difference]: Finished difference Result 625 states and 1709 transitions. [2020-02-10 20:12:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:25,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:25,988 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:12:25,988 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 20:12:25,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:25,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 20:12:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 341. [2020-02-10 20:12:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:12:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1087 transitions. [2020-02-10 20:12:25,998 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1087 transitions. Word has length 19 [2020-02-10 20:12:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:25,998 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1087 transitions. [2020-02-10 20:12:25,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1087 transitions. [2020-02-10 20:12:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:25,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:25,999 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:26,000 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1775607780, now seen corresponding path program 67 times [2020-02-10 20:12:26,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566844308] [2020-02-10 20:12:26,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:26,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566844308] [2020-02-10 20:12:26,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:26,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:26,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196169132] [2020-02-10 20:12:26,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:26,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:26,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:26,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:26,186 INFO L87 Difference]: Start difference. First operand 341 states and 1087 transitions. Second operand 8 states. [2020-02-10 20:12:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:26,267 INFO L93 Difference]: Finished difference Result 658 states and 1828 transitions. [2020-02-10 20:12:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:26,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:26,269 INFO L225 Difference]: With dead ends: 658 [2020-02-10 20:12:26,269 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 20:12:26,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:26,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 20:12:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 351. [2020-02-10 20:12:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 20:12:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1115 transitions. [2020-02-10 20:12:26,277 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1115 transitions. Word has length 19 [2020-02-10 20:12:26,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:26,277 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1115 transitions. [2020-02-10 20:12:26,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1115 transitions. [2020-02-10 20:12:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:26,278 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:26,278 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:26,279 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1645024190, now seen corresponding path program 68 times [2020-02-10 20:12:26,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618595607] [2020-02-10 20:12:26,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:26,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:26,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618595607] [2020-02-10 20:12:26,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:26,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:26,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705512918] [2020-02-10 20:12:26,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:26,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:26,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:26,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:26,505 INFO L87 Difference]: Start difference. First operand 351 states and 1115 transitions. Second operand 8 states. [2020-02-10 20:12:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:26,588 INFO L93 Difference]: Finished difference Result 648 states and 1791 transitions. [2020-02-10 20:12:26,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:26,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:26,590 INFO L225 Difference]: With dead ends: 648 [2020-02-10 20:12:26,590 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 20:12:26,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 20:12:26,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 345. [2020-02-10 20:12:26,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:12:26,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1099 transitions. [2020-02-10 20:12:26,598 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1099 transitions. Word has length 19 [2020-02-10 20:12:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:26,598 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1099 transitions. [2020-02-10 20:12:26,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1099 transitions. [2020-02-10 20:12:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:26,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:26,599 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:26,599 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,599 INFO L82 PathProgramCache]: Analyzing trace with hash -286202784, now seen corresponding path program 69 times [2020-02-10 20:12:26,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685764789] [2020-02-10 20:12:26,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:26,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685764789] [2020-02-10 20:12:26,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:26,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:26,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976690268] [2020-02-10 20:12:26,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:26,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:26,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:26,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:26,779 INFO L87 Difference]: Start difference. First operand 345 states and 1099 transitions. Second operand 8 states. [2020-02-10 20:12:26,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:26,879 INFO L93 Difference]: Finished difference Result 664 states and 1847 transitions. [2020-02-10 20:12:26,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:26,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:26,880 INFO L225 Difference]: With dead ends: 664 [2020-02-10 20:12:26,880 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 20:12:26,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 20:12:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 354. [2020-02-10 20:12:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-02-10 20:12:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1121 transitions. [2020-02-10 20:12:26,888 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1121 transitions. Word has length 19 [2020-02-10 20:12:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:26,889 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 1121 transitions. [2020-02-10 20:12:26,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1121 transitions. [2020-02-10 20:12:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:26,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:26,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:26,896 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1031499928, now seen corresponding path program 70 times [2020-02-10 20:12:26,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198430080] [2020-02-10 20:12:26,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:27,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198430080] [2020-02-10 20:12:27,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:27,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:27,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445753350] [2020-02-10 20:12:27,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:27,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:27,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:27,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:27,097 INFO L87 Difference]: Start difference. First operand 354 states and 1121 transitions. Second operand 8 states. [2020-02-10 20:12:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:27,188 INFO L93 Difference]: Finished difference Result 657 states and 1817 transitions. [2020-02-10 20:12:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:27,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:27,190 INFO L225 Difference]: With dead ends: 657 [2020-02-10 20:12:27,190 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 20:12:27,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 20:12:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 345. [2020-02-10 20:12:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:12:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1095 transitions. [2020-02-10 20:12:27,203 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1095 transitions. Word has length 19 [2020-02-10 20:12:27,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:27,203 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1095 transitions. [2020-02-10 20:12:27,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1095 transitions. [2020-02-10 20:12:27,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:27,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:27,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:27,207 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:27,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:27,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1073569384, now seen corresponding path program 71 times [2020-02-10 20:12:27,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:27,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994024695] [2020-02-10 20:12:27,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:27,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994024695] [2020-02-10 20:12:27,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:27,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:27,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686118543] [2020-02-10 20:12:27,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:27,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:27,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:27,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:27,427 INFO L87 Difference]: Start difference. First operand 345 states and 1095 transitions. Second operand 8 states. [2020-02-10 20:12:27,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:27,500 INFO L93 Difference]: Finished difference Result 639 states and 1762 transitions. [2020-02-10 20:12:27,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:27,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:27,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:27,502 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:12:27,502 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 20:12:27,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 20:12:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 349. [2020-02-10 20:12:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:12:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1103 transitions. [2020-02-10 20:12:27,512 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1103 transitions. Word has length 19 [2020-02-10 20:12:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:27,512 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1103 transitions. [2020-02-10 20:12:27,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1103 transitions. [2020-02-10 20:12:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:27,513 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:27,513 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:27,514 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:27,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1510784604, now seen corresponding path program 72 times [2020-02-10 20:12:27,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:27,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484754560] [2020-02-10 20:12:27,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:27,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:27,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484754560] [2020-02-10 20:12:27,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:27,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:27,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308814654] [2020-02-10 20:12:27,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:27,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:27,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:27,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:27,721 INFO L87 Difference]: Start difference. First operand 349 states and 1103 transitions. Second operand 8 states. [2020-02-10 20:12:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:27,810 INFO L93 Difference]: Finished difference Result 642 states and 1768 transitions. [2020-02-10 20:12:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:27,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:27,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:27,812 INFO L225 Difference]: With dead ends: 642 [2020-02-10 20:12:27,812 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 20:12:27,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 20:12:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2020-02-10 20:12:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-02-10 20:12:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1078 transitions. [2020-02-10 20:12:27,819 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1078 transitions. Word has length 19 [2020-02-10 20:12:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:27,820 INFO L479 AbstractCegarLoop]: Abstraction has 337 states and 1078 transitions. [2020-02-10 20:12:27,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1078 transitions. [2020-02-10 20:12:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:27,820 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:27,820 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:27,821 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:27,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:27,821 INFO L82 PathProgramCache]: Analyzing trace with hash 458482122, now seen corresponding path program 73 times [2020-02-10 20:12:27,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:27,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346767634] [2020-02-10 20:12:27,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:28,117 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 14 [2020-02-10 20:12:28,240 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2020-02-10 20:12:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:28,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346767634] [2020-02-10 20:12:28,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:28,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:28,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854273847] [2020-02-10 20:12:28,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:28,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:28,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:28,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:28,319 INFO L87 Difference]: Start difference. First operand 337 states and 1078 transitions. Second operand 8 states. [2020-02-10 20:12:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,405 INFO L93 Difference]: Finished difference Result 609 states and 1671 transitions. [2020-02-10 20:12:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:28,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,407 INFO L225 Difference]: With dead ends: 609 [2020-02-10 20:12:28,408 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:12:28,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:12:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 346. [2020-02-10 20:12:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:12:28,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1105 transitions. [2020-02-10 20:12:28,422 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1105 transitions. Word has length 19 [2020-02-10 20:12:28,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,422 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1105 transitions. [2020-02-10 20:12:28,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1105 transitions. [2020-02-10 20:12:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:28,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,424 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:28,424 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1693244424, now seen corresponding path program 74 times [2020-02-10 20:12:28,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885097406] [2020-02-10 20:12:28,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:28,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885097406] [2020-02-10 20:12:28,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:28,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:28,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270652329] [2020-02-10 20:12:28,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:28,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:28,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:28,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:28,602 INFO L87 Difference]: Start difference. First operand 346 states and 1105 transitions. Second operand 8 states. [2020-02-10 20:12:28,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,670 INFO L93 Difference]: Finished difference Result 608 states and 1667 transitions. [2020-02-10 20:12:28,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:28,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:28,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,672 INFO L225 Difference]: With dead ends: 608 [2020-02-10 20:12:28,672 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:12:28,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:12:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 343. [2020-02-10 20:12:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 20:12:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1098 transitions. [2020-02-10 20:12:28,682 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1098 transitions. Word has length 19 [2020-02-10 20:12:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,683 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1098 transitions. [2020-02-10 20:12:28,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1098 transitions. [2020-02-10 20:12:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:28,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,684 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:28,684 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1552573710, now seen corresponding path program 75 times [2020-02-10 20:12:28,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737934213] [2020-02-10 20:12:28,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:28,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737934213] [2020-02-10 20:12:28,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:28,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:28,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686313632] [2020-02-10 20:12:28,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:28,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:28,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:28,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:28,900 INFO L87 Difference]: Start difference. First operand 343 states and 1098 transitions. Second operand 8 states. [2020-02-10 20:12:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,965 INFO L93 Difference]: Finished difference Result 614 states and 1685 transitions. [2020-02-10 20:12:28,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:28,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,967 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:12:28,967 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:12:28,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:12:28,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 348. [2020-02-10 20:12:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 20:12:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1107 transitions. [2020-02-10 20:12:28,975 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1107 transitions. Word has length 19 [2020-02-10 20:12:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,975 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1107 transitions. [2020-02-10 20:12:28,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1107 transitions. [2020-02-10 20:12:28,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:28,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,976 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:28,976 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,977 INFO L82 PathProgramCache]: Analyzing trace with hash 801511616, now seen corresponding path program 76 times [2020-02-10 20:12:28,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513359487] [2020-02-10 20:12:28,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:29,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513359487] [2020-02-10 20:12:29,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:29,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:29,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451867636] [2020-02-10 20:12:29,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:29,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:29,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:29,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:29,205 INFO L87 Difference]: Start difference. First operand 348 states and 1107 transitions. Second operand 8 states. [2020-02-10 20:12:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:29,300 INFO L93 Difference]: Finished difference Result 616 states and 1689 transitions. [2020-02-10 20:12:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:29,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:29,302 INFO L225 Difference]: With dead ends: 616 [2020-02-10 20:12:29,302 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 20:12:29,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 20:12:29,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 343. [2020-02-10 20:12:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 20:12:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1095 transitions. [2020-02-10 20:12:29,309 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1095 transitions. Word has length 19 [2020-02-10 20:12:29,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:29,310 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1095 transitions. [2020-02-10 20:12:29,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1095 transitions. [2020-02-10 20:12:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:29,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:29,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:29,311 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:29,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:29,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1962158772, now seen corresponding path program 77 times [2020-02-10 20:12:29,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:29,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82784560] [2020-02-10 20:12:29,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:29,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82784560] [2020-02-10 20:12:29,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:29,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:29,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934855113] [2020-02-10 20:12:29,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:29,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:29,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:29,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:29,542 INFO L87 Difference]: Start difference. First operand 343 states and 1095 transitions. Second operand 8 states. [2020-02-10 20:12:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:29,632 INFO L93 Difference]: Finished difference Result 611 states and 1678 transitions. [2020-02-10 20:12:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:29,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:29,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:29,634 INFO L225 Difference]: With dead ends: 611 [2020-02-10 20:12:29,634 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 20:12:29,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 20:12:29,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 347. [2020-02-10 20:12:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:12:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1103 transitions. [2020-02-10 20:12:29,641 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1103 transitions. Word has length 19 [2020-02-10 20:12:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:29,641 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1103 transitions. [2020-02-10 20:12:29,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1103 transitions. [2020-02-10 20:12:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:29,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:29,642 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:29,642 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:29,643 INFO L82 PathProgramCache]: Analyzing trace with hash -622195216, now seen corresponding path program 78 times [2020-02-10 20:12:29,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:29,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141302622] [2020-02-10 20:12:29,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:29,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141302622] [2020-02-10 20:12:29,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:29,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:29,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513599076] [2020-02-10 20:12:29,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:29,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:29,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:29,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:29,860 INFO L87 Difference]: Start difference. First operand 347 states and 1103 transitions. Second operand 8 states. [2020-02-10 20:12:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:29,949 INFO L93 Difference]: Finished difference Result 614 states and 1684 transitions. [2020-02-10 20:12:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:29,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:29,951 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:12:29,951 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 20:12:29,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 20:12:29,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 340. [2020-02-10 20:12:29,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-02-10 20:12:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1088 transitions. [2020-02-10 20:12:29,959 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1088 transitions. Word has length 19 [2020-02-10 20:12:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:29,959 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 1088 transitions. [2020-02-10 20:12:29,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1088 transitions. [2020-02-10 20:12:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:29,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:29,960 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:29,960 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:29,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1910451096, now seen corresponding path program 79 times [2020-02-10 20:12:29,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:29,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84762062] [2020-02-10 20:12:29,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:30,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84762062] [2020-02-10 20:12:30,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:30,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:30,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726409231] [2020-02-10 20:12:30,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:30,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:30,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:30,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:30,169 INFO L87 Difference]: Start difference. First operand 340 states and 1088 transitions. Second operand 8 states. [2020-02-10 20:12:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:30,242 INFO L93 Difference]: Finished difference Result 614 states and 1683 transitions. [2020-02-10 20:12:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:30,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:30,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:30,243 INFO L225 Difference]: With dead ends: 614 [2020-02-10 20:12:30,244 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 20:12:30,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:30,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 20:12:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 346. [2020-02-10 20:12:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:12:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1102 transitions. [2020-02-10 20:12:30,250 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1102 transitions. Word has length 19 [2020-02-10 20:12:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:30,250 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1102 transitions. [2020-02-10 20:12:30,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1102 transitions. [2020-02-10 20:12:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:30,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:30,251 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:30,251 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:30,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:30,251 INFO L82 PathProgramCache]: Analyzing trace with hash 232789654, now seen corresponding path program 80 times [2020-02-10 20:12:30,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:30,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092111946] [2020-02-10 20:12:30,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:30,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092111946] [2020-02-10 20:12:30,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:30,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:30,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226563270] [2020-02-10 20:12:30,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:30,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:30,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:30,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:30,435 INFO L87 Difference]: Start difference. First operand 346 states and 1102 transitions. Second operand 8 states. [2020-02-10 20:12:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:30,521 INFO L93 Difference]: Finished difference Result 613 states and 1679 transitions. [2020-02-10 20:12:30,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:30,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:30,523 INFO L225 Difference]: With dead ends: 613 [2020-02-10 20:12:30,523 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 20:12:30,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 20:12:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 343. [2020-02-10 20:12:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 20:12:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1095 transitions. [2020-02-10 20:12:30,531 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1095 transitions. Word has length 19 [2020-02-10 20:12:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:30,531 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1095 transitions. [2020-02-10 20:12:30,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1095 transitions. [2020-02-10 20:12:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:30,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:30,532 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:30,532 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:30,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:30,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1878169934, now seen corresponding path program 81 times [2020-02-10 20:12:30,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:30,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899544703] [2020-02-10 20:12:30,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:30,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:30,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899544703] [2020-02-10 20:12:30,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:30,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:30,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555689076] [2020-02-10 20:12:30,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:30,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:30,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:30,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:30,716 INFO L87 Difference]: Start difference. First operand 343 states and 1095 transitions. Second operand 8 states. [2020-02-10 20:12:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:30,818 INFO L93 Difference]: Finished difference Result 623 states and 1709 transitions. [2020-02-10 20:12:30,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:30,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:30,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:30,821 INFO L225 Difference]: With dead ends: 623 [2020-02-10 20:12:30,821 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:12:30,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:12:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 349. [2020-02-10 20:12:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:12:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1106 transitions. [2020-02-10 20:12:30,837 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1106 transitions. Word has length 19 [2020-02-10 20:12:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:30,837 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1106 transitions. [2020-02-10 20:12:30,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1106 transitions. [2020-02-10 20:12:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:30,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:30,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:30,839 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:30,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:30,840 INFO L82 PathProgramCache]: Analyzing trace with hash 901965184, now seen corresponding path program 82 times [2020-02-10 20:12:30,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:30,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085792095] [2020-02-10 20:12:30,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:31,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085792095] [2020-02-10 20:12:31,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:31,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:31,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433108137] [2020-02-10 20:12:31,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:31,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:31,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:31,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:31,109 INFO L87 Difference]: Start difference. First operand 349 states and 1106 transitions. Second operand 8 states. [2020-02-10 20:12:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:31,211 INFO L93 Difference]: Finished difference Result 628 states and 1721 transitions. [2020-02-10 20:12:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:31,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:31,213 INFO L225 Difference]: With dead ends: 628 [2020-02-10 20:12:31,213 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 20:12:31,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 20:12:31,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 343. [2020-02-10 20:12:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 20:12:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1092 transitions. [2020-02-10 20:12:31,225 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1092 transitions. Word has length 19 [2020-02-10 20:12:31,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:31,225 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1092 transitions. [2020-02-10 20:12:31,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1092 transitions. [2020-02-10 20:12:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:31,227 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:31,228 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:31,228 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:31,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:31,228 INFO L82 PathProgramCache]: Analyzing trace with hash 348431156, now seen corresponding path program 83 times [2020-02-10 20:12:31,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:31,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71048792] [2020-02-10 20:12:31,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:31,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71048792] [2020-02-10 20:12:31,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:31,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:31,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215036712] [2020-02-10 20:12:31,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:31,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:31,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:31,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:31,420 INFO L87 Difference]: Start difference. First operand 343 states and 1092 transitions. Second operand 8 states. [2020-02-10 20:12:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:31,511 INFO L93 Difference]: Finished difference Result 620 states and 1702 transitions. [2020-02-10 20:12:31,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:31,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:31,513 INFO L225 Difference]: With dead ends: 620 [2020-02-10 20:12:31,513 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:12:31,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:31,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:12:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 348. [2020-02-10 20:12:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 20:12:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1102 transitions. [2020-02-10 20:12:31,522 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1102 transitions. Word has length 19 [2020-02-10 20:12:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:31,523 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1102 transitions. [2020-02-10 20:12:31,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1102 transitions. [2020-02-10 20:12:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:31,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:31,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:31,524 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:31,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:31,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1380616178, now seen corresponding path program 84 times [2020-02-10 20:12:31,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:31,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432832059] [2020-02-10 20:12:31,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:31,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432832059] [2020-02-10 20:12:31,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:31,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:31,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439191820] [2020-02-10 20:12:31,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:31,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:31,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:31,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:31,712 INFO L87 Difference]: Start difference. First operand 348 states and 1102 transitions. Second operand 8 states. [2020-02-10 20:12:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:31,795 INFO L93 Difference]: Finished difference Result 626 states and 1716 transitions. [2020-02-10 20:12:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:31,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:31,796 INFO L225 Difference]: With dead ends: 626 [2020-02-10 20:12:31,797 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 20:12:31,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:31,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 20:12:31,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 340. [2020-02-10 20:12:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-02-10 20:12:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1085 transitions. [2020-02-10 20:12:31,803 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1085 transitions. Word has length 19 [2020-02-10 20:12:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:31,804 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 1085 transitions. [2020-02-10 20:12:31,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1085 transitions. [2020-02-10 20:12:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:31,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:31,804 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:31,805 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:31,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1259258648, now seen corresponding path program 85 times [2020-02-10 20:12:31,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:31,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477697355] [2020-02-10 20:12:31,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:32,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477697355] [2020-02-10 20:12:32,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:32,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:32,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473407125] [2020-02-10 20:12:32,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:32,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:32,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:32,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:32,021 INFO L87 Difference]: Start difference. First operand 340 states and 1085 transitions. Second operand 8 states. [2020-02-10 20:12:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:32,097 INFO L93 Difference]: Finished difference Result 629 states and 1736 transitions. [2020-02-10 20:12:32,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:32,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:32,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:32,099 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:12:32,099 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:12:32,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:32,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:12:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 350. [2020-02-10 20:12:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 20:12:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1113 transitions. [2020-02-10 20:12:32,107 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1113 transitions. Word has length 19 [2020-02-10 20:12:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:32,107 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1113 transitions. [2020-02-10 20:12:32,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1113 transitions. [2020-02-10 20:12:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:32,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:32,108 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:32,108 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:32,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:32,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2010320742, now seen corresponding path program 86 times [2020-02-10 20:12:32,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:32,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169214613] [2020-02-10 20:12:32,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:32,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169214613] [2020-02-10 20:12:32,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:32,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:32,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092041564] [2020-02-10 20:12:32,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:32,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:32,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:32,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:32,320 INFO L87 Difference]: Start difference. First operand 350 states and 1113 transitions. Second operand 8 states. [2020-02-10 20:12:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:32,401 INFO L93 Difference]: Finished difference Result 631 states and 1740 transitions. [2020-02-10 20:12:32,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:32,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:32,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:32,403 INFO L225 Difference]: With dead ends: 631 [2020-02-10 20:12:32,403 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:12:32,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:12:32,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 345. [2020-02-10 20:12:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:12:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1099 transitions. [2020-02-10 20:12:32,411 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1099 transitions. Word has length 19 [2020-02-10 20:12:32,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:32,411 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1099 transitions. [2020-02-10 20:12:32,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1099 transitions. [2020-02-10 20:12:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:32,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:32,412 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:32,412 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:32,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:32,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1435270794, now seen corresponding path program 87 times [2020-02-10 20:12:32,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:32,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219978697] [2020-02-10 20:12:32,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:32,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219978697] [2020-02-10 20:12:32,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:32,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:32,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669469176] [2020-02-10 20:12:32,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:32,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:32,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:32,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:32,633 INFO L87 Difference]: Start difference. First operand 345 states and 1099 transitions. Second operand 8 states. [2020-02-10 20:12:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:32,707 INFO L93 Difference]: Finished difference Result 633 states and 1743 transitions. [2020-02-10 20:12:32,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:32,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:32,708 INFO L225 Difference]: With dead ends: 633 [2020-02-10 20:12:32,709 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:12:32,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:12:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 351. [2020-02-10 20:12:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 20:12:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1110 transitions. [2020-02-10 20:12:32,716 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1110 transitions. Word has length 19 [2020-02-10 20:12:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:32,716 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1110 transitions. [2020-02-10 20:12:32,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1110 transitions. [2020-02-10 20:12:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:32,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:32,717 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:32,718 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:32,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:32,718 INFO L82 PathProgramCache]: Analyzing trace with hash 459066044, now seen corresponding path program 88 times [2020-02-10 20:12:32,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:32,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618282803] [2020-02-10 20:12:32,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:32,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618282803] [2020-02-10 20:12:32,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:32,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:32,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146805750] [2020-02-10 20:12:32,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:32,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:32,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:32,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:32,927 INFO L87 Difference]: Start difference. First operand 351 states and 1110 transitions. Second operand 8 states. [2020-02-10 20:12:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:33,024 INFO L93 Difference]: Finished difference Result 638 states and 1755 transitions. [2020-02-10 20:12:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:33,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:33,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:33,026 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:12:33,026 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:12:33,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:12:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 345. [2020-02-10 20:12:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:12:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1094 transitions. [2020-02-10 20:12:33,036 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1094 transitions. Word has length 19 [2020-02-10 20:12:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:33,037 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1094 transitions. [2020-02-10 20:12:33,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1094 transitions. [2020-02-10 20:12:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:33,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:33,038 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:33,038 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:33,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:33,038 INFO L82 PathProgramCache]: Analyzing trace with hash 2087070376, now seen corresponding path program 89 times [2020-02-10 20:12:33,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:33,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506678800] [2020-02-10 20:12:33,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:33,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506678800] [2020-02-10 20:12:33,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:33,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:33,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061221975] [2020-02-10 20:12:33,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:33,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:33,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:33,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:33,308 INFO L87 Difference]: Start difference. First operand 345 states and 1094 transitions. Second operand 8 states. [2020-02-10 20:12:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:33,392 INFO L93 Difference]: Finished difference Result 639 states and 1767 transitions. [2020-02-10 20:12:33,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:33,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:33,394 INFO L225 Difference]: With dead ends: 639 [2020-02-10 20:12:33,394 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 20:12:33,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 20:12:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 353. [2020-02-10 20:12:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-02-10 20:12:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1114 transitions. [2020-02-10 20:12:33,401 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1114 transitions. Word has length 19 [2020-02-10 20:12:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:33,401 INFO L479 AbstractCegarLoop]: Abstraction has 353 states and 1114 transitions. [2020-02-10 20:12:33,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1114 transitions. [2020-02-10 20:12:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:33,402 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:33,402 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:33,402 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1349022390, now seen corresponding path program 90 times [2020-02-10 20:12:33,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:33,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096363671] [2020-02-10 20:12:33,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:33,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:33,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096363671] [2020-02-10 20:12:33,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:33,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:33,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427051164] [2020-02-10 20:12:33,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:33,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:33,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:33,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:33,616 INFO L87 Difference]: Start difference. First operand 353 states and 1114 transitions. Second operand 8 states. [2020-02-10 20:12:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:33,715 INFO L93 Difference]: Finished difference Result 642 states and 1768 transitions. [2020-02-10 20:12:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:33,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:33,717 INFO L225 Difference]: With dead ends: 642 [2020-02-10 20:12:33,717 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 20:12:33,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:33,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 20:12:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 340. [2020-02-10 20:12:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-02-10 20:12:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1082 transitions. [2020-02-10 20:12:33,726 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1082 transitions. Word has length 19 [2020-02-10 20:12:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:33,726 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 1082 transitions. [2020-02-10 20:12:33,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:33,727 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1082 transitions. [2020-02-10 20:12:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:33,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:33,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:33,727 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:33,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1252078038, now seen corresponding path program 91 times [2020-02-10 20:12:33,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:33,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582040224] [2020-02-10 20:12:33,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:33,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582040224] [2020-02-10 20:12:33,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:33,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:33,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65730101] [2020-02-10 20:12:33,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:33,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:33,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:33,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:33,922 INFO L87 Difference]: Start difference. First operand 340 states and 1082 transitions. Second operand 8 states. [2020-02-10 20:12:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:34,004 INFO L93 Difference]: Finished difference Result 622 states and 1721 transitions. [2020-02-10 20:12:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:34,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:34,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:34,006 INFO L225 Difference]: With dead ends: 622 [2020-02-10 20:12:34,006 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 20:12:34,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 20:12:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 348. [2020-02-10 20:12:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 20:12:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1106 transitions. [2020-02-10 20:12:34,013 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1106 transitions. Word has length 19 [2020-02-10 20:12:34,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:34,013 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1106 transitions. [2020-02-10 20:12:34,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1106 transitions. [2020-02-10 20:12:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:34,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:34,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:34,014 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:34,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:34,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1332275950, now seen corresponding path program 92 times [2020-02-10 20:12:34,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:34,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179394065] [2020-02-10 20:12:34,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:34,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179394065] [2020-02-10 20:12:34,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:34,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:34,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932338763] [2020-02-10 20:12:34,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:34,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:34,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:34,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:34,221 INFO L87 Difference]: Start difference. First operand 348 states and 1106 transitions. Second operand 8 states. [2020-02-10 20:12:34,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:34,320 INFO L93 Difference]: Finished difference Result 625 states and 1727 transitions. [2020-02-10 20:12:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:34,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:34,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:34,323 INFO L225 Difference]: With dead ends: 625 [2020-02-10 20:12:34,323 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 20:12:34,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 20:12:34,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 344. [2020-02-10 20:12:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 20:12:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1094 transitions. [2020-02-10 20:12:34,332 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1094 transitions. Word has length 19 [2020-02-10 20:12:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:34,333 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1094 transitions. [2020-02-10 20:12:34,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:34,333 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1094 transitions. [2020-02-10 20:12:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:34,334 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:34,334 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:34,334 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:34,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:34,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1996780536, now seen corresponding path program 93 times [2020-02-10 20:12:34,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:34,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045325009] [2020-02-10 20:12:34,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:34,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045325009] [2020-02-10 20:12:34,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:34,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:34,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907907554] [2020-02-10 20:12:34,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:34,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:34,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:34,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:34,559 INFO L87 Difference]: Start difference. First operand 344 states and 1094 transitions. Second operand 8 states. [2020-02-10 20:12:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:34,676 INFO L93 Difference]: Finished difference Result 626 states and 1729 transitions. [2020-02-10 20:12:34,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:34,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:34,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:34,677 INFO L225 Difference]: With dead ends: 626 [2020-02-10 20:12:34,677 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 20:12:34,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:34,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 20:12:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 349. [2020-02-10 20:12:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:12:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1104 transitions. [2020-02-10 20:12:34,684 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1104 transitions. Word has length 19 [2020-02-10 20:12:34,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:34,684 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1104 transitions. [2020-02-10 20:12:34,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1104 transitions. [2020-02-10 20:12:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:34,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:34,685 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:34,685 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:34,685 INFO L82 PathProgramCache]: Analyzing trace with hash 267733202, now seen corresponding path program 94 times [2020-02-10 20:12:34,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:34,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987925003] [2020-02-10 20:12:34,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:34,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987925003] [2020-02-10 20:12:34,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:34,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:34,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022685447] [2020-02-10 20:12:34,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:34,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:34,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:34,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:34,894 INFO L87 Difference]: Start difference. First operand 349 states and 1104 transitions. Second operand 8 states. [2020-02-10 20:12:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:34,999 INFO L93 Difference]: Finished difference Result 632 states and 1743 transitions. [2020-02-10 20:12:34,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:34,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:35,001 INFO L225 Difference]: With dead ends: 632 [2020-02-10 20:12:35,001 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 20:12:35,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 20:12:35,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 344. [2020-02-10 20:12:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 20:12:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1090 transitions. [2020-02-10 20:12:35,011 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1090 transitions. Word has length 19 [2020-02-10 20:12:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:35,011 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1090 transitions. [2020-02-10 20:12:35,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1090 transitions. [2020-02-10 20:12:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:35,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:35,013 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:35,013 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:35,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:35,013 INFO L82 PathProgramCache]: Analyzing trace with hash 901831544, now seen corresponding path program 95 times [2020-02-10 20:12:35,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:35,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421326769] [2020-02-10 20:12:35,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:35,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421326769] [2020-02-10 20:12:35,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:35,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:35,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818590449] [2020-02-10 20:12:35,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:35,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:35,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:35,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:35,237 INFO L87 Difference]: Start difference. First operand 344 states and 1090 transitions. Second operand 8 states. [2020-02-10 20:12:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:35,317 INFO L93 Difference]: Finished difference Result 635 states and 1758 transitions. [2020-02-10 20:12:35,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:35,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:35,318 INFO L225 Difference]: With dead ends: 635 [2020-02-10 20:12:35,319 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 20:12:35,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 20:12:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 352. [2020-02-10 20:12:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 20:12:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1110 transitions. [2020-02-10 20:12:35,327 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1110 transitions. Word has length 19 [2020-02-10 20:12:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:35,327 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1110 transitions. [2020-02-10 20:12:35,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1110 transitions. [2020-02-10 20:12:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:35,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:35,328 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:35,328 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1757138198, now seen corresponding path program 96 times [2020-02-10 20:12:35,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:35,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562721229] [2020-02-10 20:12:35,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:35,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562721229] [2020-02-10 20:12:35,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:35,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:35,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650450119] [2020-02-10 20:12:35,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:35,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:35,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:35,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:35,545 INFO L87 Difference]: Start difference. First operand 352 states and 1110 transitions. Second operand 8 states. [2020-02-10 20:12:35,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:35,649 INFO L93 Difference]: Finished difference Result 638 states and 1759 transitions. [2020-02-10 20:12:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:35,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:35,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:35,651 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:12:35,651 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 20:12:35,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:35,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 20:12:35,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 337. [2020-02-10 20:12:35,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-02-10 20:12:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1075 transitions. [2020-02-10 20:12:35,661 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1075 transitions. Word has length 19 [2020-02-10 20:12:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:35,662 INFO L479 AbstractCegarLoop]: Abstraction has 337 states and 1075 transitions. [2020-02-10 20:12:35,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1075 transitions. [2020-02-10 20:12:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:35,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:35,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:35,663 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:35,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:35,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1665827752, now seen corresponding path program 97 times [2020-02-10 20:12:35,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:35,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368703355] [2020-02-10 20:12:35,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:35,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368703355] [2020-02-10 20:12:35,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:35,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:35,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247268268] [2020-02-10 20:12:35,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:35,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:35,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:35,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:35,846 INFO L87 Difference]: Start difference. First operand 337 states and 1075 transitions. Second operand 8 states. [2020-02-10 20:12:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:35,928 INFO L93 Difference]: Finished difference Result 676 states and 1927 transitions. [2020-02-10 20:12:35,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:35,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:35,930 INFO L225 Difference]: With dead ends: 676 [2020-02-10 20:12:35,930 INFO L226 Difference]: Without dead ends: 636 [2020-02-10 20:12:35,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:35,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-02-10 20:12:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 351. [2020-02-10 20:12:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 20:12:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1123 transitions. [2020-02-10 20:12:35,938 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1123 transitions. Word has length 19 [2020-02-10 20:12:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:35,938 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1123 transitions. [2020-02-10 20:12:35,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1123 transitions. [2020-02-10 20:12:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:35,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:35,940 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:35,940 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:35,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:35,940 INFO L82 PathProgramCache]: Analyzing trace with hash 791492426, now seen corresponding path program 98 times [2020-02-10 20:12:35,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:35,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439192940] [2020-02-10 20:12:35,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:36,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439192940] [2020-02-10 20:12:36,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:36,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:36,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532198454] [2020-02-10 20:12:36,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:36,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:36,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:36,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:36,127 INFO L87 Difference]: Start difference. First operand 351 states and 1123 transitions. Second operand 8 states. [2020-02-10 20:12:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:36,215 INFO L93 Difference]: Finished difference Result 666 states and 1890 transitions. [2020-02-10 20:12:36,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:36,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:36,216 INFO L225 Difference]: With dead ends: 666 [2020-02-10 20:12:36,216 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 20:12:36,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:36,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 20:12:36,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 345. [2020-02-10 20:12:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:12:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1107 transitions. [2020-02-10 20:12:36,226 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1107 transitions. Word has length 19 [2020-02-10 20:12:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:36,226 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1107 transitions. [2020-02-10 20:12:36,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1107 transitions. [2020-02-10 20:12:36,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:36,227 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:36,227 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:36,227 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:36,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1139734548, now seen corresponding path program 99 times [2020-02-10 20:12:36,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:36,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278815482] [2020-02-10 20:12:36,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:36,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278815482] [2020-02-10 20:12:36,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:36,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:36,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654374984] [2020-02-10 20:12:36,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:36,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:36,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:36,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:36,413 INFO L87 Difference]: Start difference. First operand 345 states and 1107 transitions. Second operand 8 states. [2020-02-10 20:12:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:36,497 INFO L93 Difference]: Finished difference Result 682 states and 1946 transitions. [2020-02-10 20:12:36,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:36,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:36,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:36,499 INFO L225 Difference]: With dead ends: 682 [2020-02-10 20:12:36,499 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 20:12:36,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 20:12:36,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 354. [2020-02-10 20:12:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-02-10 20:12:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1129 transitions. [2020-02-10 20:12:36,508 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1129 transitions. Word has length 19 [2020-02-10 20:12:36,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:36,508 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 1129 transitions. [2020-02-10 20:12:36,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:36,508 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1129 transitions. [2020-02-10 20:12:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:36,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:36,509 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:36,509 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:36,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:36,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1885031692, now seen corresponding path program 100 times [2020-02-10 20:12:36,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:36,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455786180] [2020-02-10 20:12:36,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:36,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455786180] [2020-02-10 20:12:36,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:36,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:36,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757687848] [2020-02-10 20:12:36,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:36,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:36,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:36,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:36,698 INFO L87 Difference]: Start difference. First operand 354 states and 1129 transitions. Second operand 8 states. [2020-02-10 20:12:36,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:36,779 INFO L93 Difference]: Finished difference Result 675 states and 1916 transitions. [2020-02-10 20:12:36,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:36,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:36,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:36,781 INFO L225 Difference]: With dead ends: 675 [2020-02-10 20:12:36,781 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 20:12:36,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:36,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 20:12:36,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 345. [2020-02-10 20:12:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:12:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-02-10 20:12:36,788 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-02-10 20:12:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:36,789 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-02-10 20:12:36,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-02-10 20:12:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:36,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:36,789 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:36,789 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:36,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:36,790 INFO L82 PathProgramCache]: Analyzing trace with hash 220037620, now seen corresponding path program 101 times [2020-02-10 20:12:36,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:36,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755432602] [2020-02-10 20:12:36,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:36,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:36,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755432602] [2020-02-10 20:12:36,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:36,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:36,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578708784] [2020-02-10 20:12:36,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:36,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:36,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:36,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:36,992 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-02-10 20:12:37,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:37,067 INFO L93 Difference]: Finished difference Result 657 states and 1861 transitions. [2020-02-10 20:12:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:37,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:37,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:37,069 INFO L225 Difference]: With dead ends: 657 [2020-02-10 20:12:37,069 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 20:12:37,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 20:12:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 349. [2020-02-10 20:12:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:12:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1111 transitions. [2020-02-10 20:12:37,077 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1111 transitions. Word has length 19 [2020-02-10 20:12:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:37,077 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1111 transitions. [2020-02-10 20:12:37,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1111 transitions. [2020-02-10 20:12:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:37,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:37,078 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:37,078 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:37,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:37,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1930650928, now seen corresponding path program 102 times [2020-02-10 20:12:37,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:37,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740519596] [2020-02-10 20:12:37,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:37,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740519596] [2020-02-10 20:12:37,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:37,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:37,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411715182] [2020-02-10 20:12:37,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:37,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:37,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:37,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:37,257 INFO L87 Difference]: Start difference. First operand 349 states and 1111 transitions. Second operand 8 states. [2020-02-10 20:12:37,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:37,342 INFO L93 Difference]: Finished difference Result 660 states and 1867 transitions. [2020-02-10 20:12:37,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:37,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:37,344 INFO L225 Difference]: With dead ends: 660 [2020-02-10 20:12:37,344 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:12:37,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:37,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:12:37,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 341. [2020-02-10 20:12:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:12:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1091 transitions. [2020-02-10 20:12:37,352 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1091 transitions. Word has length 19 [2020-02-10 20:12:37,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:37,352 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1091 transitions. [2020-02-10 20:12:37,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1091 transitions. [2020-02-10 20:12:37,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:37,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:37,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:37,353 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:37,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:37,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1018198586, now seen corresponding path program 103 times [2020-02-10 20:12:37,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:37,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778710666] [2020-02-10 20:12:37,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:37,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778710666] [2020-02-10 20:12:37,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:37,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:37,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500591452] [2020-02-10 20:12:37,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:37,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:37,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:37,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:37,526 INFO L87 Difference]: Start difference. First operand 341 states and 1091 transitions. Second operand 8 states. [2020-02-10 20:12:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:37,613 INFO L93 Difference]: Finished difference Result 684 states and 1951 transitions. [2020-02-10 20:12:37,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:37,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:37,615 INFO L225 Difference]: With dead ends: 684 [2020-02-10 20:12:37,615 INFO L226 Difference]: Without dead ends: 644 [2020-02-10 20:12:37,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-02-10 20:12:37,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 352. [2020-02-10 20:12:37,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 20:12:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1123 transitions. [2020-02-10 20:12:37,623 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1123 transitions. Word has length 19 [2020-02-10 20:12:37,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:37,624 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1123 transitions. [2020-02-10 20:12:37,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:37,624 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1123 transitions. [2020-02-10 20:12:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:37,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:37,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:37,624 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:37,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:37,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1892533912, now seen corresponding path program 104 times [2020-02-10 20:12:37,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:37,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237283440] [2020-02-10 20:12:37,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:37,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237283440] [2020-02-10 20:12:37,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:37,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:37,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790137159] [2020-02-10 20:12:37,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:37,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:37,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:37,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:37,806 INFO L87 Difference]: Start difference. First operand 352 states and 1123 transitions. Second operand 8 states. [2020-02-10 20:12:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:37,891 INFO L93 Difference]: Finished difference Result 674 states and 1914 transitions. [2020-02-10 20:12:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:37,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:37,893 INFO L225 Difference]: With dead ends: 674 [2020-02-10 20:12:37,893 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 20:12:37,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 20:12:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 346. [2020-02-10 20:12:37,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:12:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1106 transitions. [2020-02-10 20:12:37,903 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1106 transitions. Word has length 19 [2020-02-10 20:12:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:37,903 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1106 transitions. [2020-02-10 20:12:37,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1106 transitions. [2020-02-10 20:12:37,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:37,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:37,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:37,905 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:37,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:37,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1215908908, now seen corresponding path program 105 times [2020-02-10 20:12:37,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:37,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635278642] [2020-02-10 20:12:37,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:38,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635278642] [2020-02-10 20:12:38,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:38,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:38,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066247080] [2020-02-10 20:12:38,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:38,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:38,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:38,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:38,135 INFO L87 Difference]: Start difference. First operand 346 states and 1106 transitions. Second operand 8 states. [2020-02-10 20:12:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:38,221 INFO L93 Difference]: Finished difference Result 696 states and 1990 transitions. [2020-02-10 20:12:38,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:38,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:38,223 INFO L225 Difference]: With dead ends: 696 [2020-02-10 20:12:38,223 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:12:38,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:12:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 358. [2020-02-10 20:12:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-02-10 20:12:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1137 transitions. [2020-02-10 20:12:38,229 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1137 transitions. Word has length 19 [2020-02-10 20:12:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:38,230 INFO L479 AbstractCegarLoop]: Abstraction has 358 states and 1137 transitions. [2020-02-10 20:12:38,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1137 transitions. [2020-02-10 20:12:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:38,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:38,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:38,231 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:38,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:38,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2110174348, now seen corresponding path program 106 times [2020-02-10 20:12:38,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:38,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219772330] [2020-02-10 20:12:38,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:38,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:38,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219772330] [2020-02-10 20:12:38,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:38,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:38,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994172955] [2020-02-10 20:12:38,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:38,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:38,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:38,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:38,424 INFO L87 Difference]: Start difference. First operand 358 states and 1137 transitions. Second operand 8 states. [2020-02-10 20:12:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:38,512 INFO L93 Difference]: Finished difference Result 692 states and 1966 transitions. [2020-02-10 20:12:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:38,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:38,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:38,515 INFO L225 Difference]: With dead ends: 692 [2020-02-10 20:12:38,515 INFO L226 Difference]: Without dead ends: 644 [2020-02-10 20:12:38,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:38,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-02-10 20:12:38,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 346. [2020-02-10 20:12:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:12:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1101 transitions. [2020-02-10 20:12:38,523 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1101 transitions. Word has length 19 [2020-02-10 20:12:38,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:38,523 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1101 transitions. [2020-02-10 20:12:38,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:38,523 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1101 transitions. [2020-02-10 20:12:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:38,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:38,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:38,524 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:38,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:38,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1719286220, now seen corresponding path program 107 times [2020-02-10 20:12:38,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:38,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996571755] [2020-02-10 20:12:38,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:38,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996571755] [2020-02-10 20:12:38,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:38,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:38,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267232537] [2020-02-10 20:12:38,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:38,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:38,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:38,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:38,719 INFO L87 Difference]: Start difference. First operand 346 states and 1101 transitions. Second operand 8 states. [2020-02-10 20:12:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:38,797 INFO L93 Difference]: Finished difference Result 669 states and 1895 transitions. [2020-02-10 20:12:38,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:38,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:38,800 INFO L225 Difference]: With dead ends: 669 [2020-02-10 20:12:38,800 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 20:12:38,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 20:12:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 351. [2020-02-10 20:12:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 20:12:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1111 transitions. [2020-02-10 20:12:38,808 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1111 transitions. Word has length 19 [2020-02-10 20:12:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:38,809 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1111 transitions. [2020-02-10 20:12:38,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1111 transitions. [2020-02-10 20:12:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:38,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:38,810 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:38,810 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:38,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:38,810 INFO L82 PathProgramCache]: Analyzing trace with hash 846633742, now seen corresponding path program 108 times [2020-02-10 20:12:38,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:38,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585037972] [2020-02-10 20:12:38,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:39,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585037972] [2020-02-10 20:12:39,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:39,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:39,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484833166] [2020-02-10 20:12:39,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:39,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:39,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:39,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:39,013 INFO L87 Difference]: Start difference. First operand 351 states and 1111 transitions. Second operand 8 states. [2020-02-10 20:12:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:39,093 INFO L93 Difference]: Finished difference Result 675 states and 1909 transitions. [2020-02-10 20:12:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:39,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:39,095 INFO L225 Difference]: With dead ends: 675 [2020-02-10 20:12:39,095 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 20:12:39,095 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:39,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 20:12:39,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 341. [2020-02-10 20:12:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:12:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1087 transitions. [2020-02-10 20:12:39,102 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1087 transitions. Word has length 19 [2020-02-10 20:12:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:39,103 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1087 transitions. [2020-02-10 20:12:39,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1087 transitions. [2020-02-10 20:12:39,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:39,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:39,103 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:39,103 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:39,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:39,104 INFO L82 PathProgramCache]: Analyzing trace with hash -601878970, now seen corresponding path program 109 times [2020-02-10 20:12:39,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:39,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742197373] [2020-02-10 20:12:39,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:39,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:39,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742197373] [2020-02-10 20:12:39,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:39,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:39,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303068731] [2020-02-10 20:12:39,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:39,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:39,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:39,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:39,301 INFO L87 Difference]: Start difference. First operand 341 states and 1087 transitions. Second operand 8 states. [2020-02-10 20:12:39,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:39,394 INFO L93 Difference]: Finished difference Result 702 states and 2022 transitions. [2020-02-10 20:12:39,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:39,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:39,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:39,396 INFO L225 Difference]: With dead ends: 702 [2020-02-10 20:12:39,396 INFO L226 Difference]: Without dead ends: 662 [2020-02-10 20:12:39,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-02-10 20:12:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 358. [2020-02-10 20:12:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-02-10 20:12:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1145 transitions. [2020-02-10 20:12:39,404 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1145 transitions. Word has length 19 [2020-02-10 20:12:39,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:39,404 INFO L479 AbstractCegarLoop]: Abstraction has 358 states and 1145 transitions. [2020-02-10 20:12:39,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1145 transitions. [2020-02-10 20:12:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:39,405 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:39,405 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:39,405 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:39,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:39,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1347176114, now seen corresponding path program 110 times [2020-02-10 20:12:39,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:39,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260506299] [2020-02-10 20:12:39,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:39,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260506299] [2020-02-10 20:12:39,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:39,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:39,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027855581] [2020-02-10 20:12:39,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:39,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:39,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:39,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:39,602 INFO L87 Difference]: Start difference. First operand 358 states and 1145 transitions. Second operand 8 states. [2020-02-10 20:12:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:39,685 INFO L93 Difference]: Finished difference Result 695 states and 1992 transitions. [2020-02-10 20:12:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:39,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:39,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:39,687 INFO L225 Difference]: With dead ends: 695 [2020-02-10 20:12:39,687 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 20:12:39,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 20:12:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 349. [2020-02-10 20:12:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:12:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1115 transitions. [2020-02-10 20:12:39,695 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1115 transitions. Word has length 19 [2020-02-10 20:12:39,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:39,695 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1115 transitions. [2020-02-10 20:12:39,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1115 transitions. [2020-02-10 20:12:39,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:39,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:39,696 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:39,697 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:39,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:39,697 INFO L82 PathProgramCache]: Analyzing trace with hash 142823528, now seen corresponding path program 111 times [2020-02-10 20:12:39,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:39,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895948509] [2020-02-10 20:12:39,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:39,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895948509] [2020-02-10 20:12:39,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:39,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:39,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574600950] [2020-02-10 20:12:39,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:39,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:39,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:39,912 INFO L87 Difference]: Start difference. First operand 349 states and 1115 transitions. Second operand 8 states. [2020-02-10 20:12:39,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:39,996 INFO L93 Difference]: Finished difference Result 708 states and 2035 transitions. [2020-02-10 20:12:39,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:39,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:39,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:39,998 INFO L225 Difference]: With dead ends: 708 [2020-02-10 20:12:39,998 INFO L226 Difference]: Without dead ends: 668 [2020-02-10 20:12:39,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-02-10 20:12:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 361. [2020-02-10 20:12:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-02-10 20:12:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 1146 transitions. [2020-02-10 20:12:40,006 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 1146 transitions. Word has length 19 [2020-02-10 20:12:40,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:40,006 INFO L479 AbstractCegarLoop]: Abstraction has 361 states and 1146 transitions. [2020-02-10 20:12:40,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 1146 transitions. [2020-02-10 20:12:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:40,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:40,007 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:40,007 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:40,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:40,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1111707568, now seen corresponding path program 112 times [2020-02-10 20:12:40,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:40,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296946337] [2020-02-10 20:12:40,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:40,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296946337] [2020-02-10 20:12:40,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:40,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:40,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544059921] [2020-02-10 20:12:40,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:40,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:40,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:40,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:40,203 INFO L87 Difference]: Start difference. First operand 361 states and 1146 transitions. Second operand 8 states. [2020-02-10 20:12:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:40,294 INFO L93 Difference]: Finished difference Result 704 states and 2011 transitions. [2020-02-10 20:12:40,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:40,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:40,296 INFO L225 Difference]: With dead ends: 704 [2020-02-10 20:12:40,296 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:12:40,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:12:40,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 349. [2020-02-10 20:12:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:12:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1107 transitions. [2020-02-10 20:12:40,303 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1107 transitions. Word has length 19 [2020-02-10 20:12:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:40,303 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1107 transitions. [2020-02-10 20:12:40,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1107 transitions. [2020-02-10 20:12:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:40,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:40,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:40,304 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:40,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1376541946, now seen corresponding path program 113 times [2020-02-10 20:12:40,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:40,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111896102] [2020-02-10 20:12:40,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:40,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111896102] [2020-02-10 20:12:40,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:40,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:40,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895628482] [2020-02-10 20:12:40,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:40,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:40,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:40,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:40,501 INFO L87 Difference]: Start difference. First operand 349 states and 1107 transitions. Second operand 8 states. [2020-02-10 20:12:40,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:40,580 INFO L93 Difference]: Finished difference Result 690 states and 1970 transitions. [2020-02-10 20:12:40,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:40,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:40,582 INFO L225 Difference]: With dead ends: 690 [2020-02-10 20:12:40,582 INFO L226 Difference]: Without dead ends: 657 [2020-02-10 20:12:40,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:40,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-02-10 20:12:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 357. [2020-02-10 20:12:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-02-10 20:12:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1127 transitions. [2020-02-10 20:12:40,589 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1127 transitions. Word has length 19 [2020-02-10 20:12:40,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:40,589 INFO L479 AbstractCegarLoop]: Abstraction has 357 states and 1127 transitions. [2020-02-10 20:12:40,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1127 transitions. [2020-02-10 20:12:40,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:40,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:40,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:40,590 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:40,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:40,590 INFO L82 PathProgramCache]: Analyzing trace with hash -517667416, now seen corresponding path program 114 times [2020-02-10 20:12:40,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:40,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954177202] [2020-02-10 20:12:40,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:40,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954177202] [2020-02-10 20:12:40,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:40,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:40,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383573904] [2020-02-10 20:12:40,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:40,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:40,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:40,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:40,819 INFO L87 Difference]: Start difference. First operand 357 states and 1127 transitions. Second operand 8 states. [2020-02-10 20:12:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:40,906 INFO L93 Difference]: Finished difference Result 693 states and 1971 transitions. [2020-02-10 20:12:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:40,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:40,908 INFO L225 Difference]: With dead ends: 693 [2020-02-10 20:12:40,908 INFO L226 Difference]: Without dead ends: 641 [2020-02-10 20:12:40,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-02-10 20:12:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 341. [2020-02-10 20:12:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:12:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1083 transitions. [2020-02-10 20:12:40,914 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1083 transitions. Word has length 19 [2020-02-10 20:12:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:40,915 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1083 transitions. [2020-02-10 20:12:40,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1083 transitions. [2020-02-10 20:12:40,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:40,915 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:40,915 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:40,916 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:40,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:40,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1295748776, now seen corresponding path program 115 times [2020-02-10 20:12:40,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:40,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443728775] [2020-02-10 20:12:40,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:41,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443728775] [2020-02-10 20:12:41,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:41,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:41,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360260832] [2020-02-10 20:12:41,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:41,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:41,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:41,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:41,110 INFO L87 Difference]: Start difference. First operand 341 states and 1083 transitions. Second operand 8 states. [2020-02-10 20:12:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:41,192 INFO L93 Difference]: Finished difference Result 651 states and 1839 transitions. [2020-02-10 20:12:41,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:41,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:41,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:41,194 INFO L225 Difference]: With dead ends: 651 [2020-02-10 20:12:41,194 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 20:12:41,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 20:12:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 349. [2020-02-10 20:12:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 20:12:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1107 transitions. [2020-02-10 20:12:41,202 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1107 transitions. Word has length 19 [2020-02-10 20:12:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:41,203 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1107 transitions. [2020-02-10 20:12:41,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1107 transitions. [2020-02-10 20:12:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:41,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:41,203 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:41,203 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:41,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:41,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1288605212, now seen corresponding path program 116 times [2020-02-10 20:12:41,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:41,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360594280] [2020-02-10 20:12:41,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:41,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360594280] [2020-02-10 20:12:41,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:41,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:41,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146614529] [2020-02-10 20:12:41,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:41,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:41,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:41,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:41,405 INFO L87 Difference]: Start difference. First operand 349 states and 1107 transitions. Second operand 8 states. [2020-02-10 20:12:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:41,479 INFO L93 Difference]: Finished difference Result 654 states and 1845 transitions. [2020-02-10 20:12:41,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:41,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:41,481 INFO L225 Difference]: With dead ends: 654 [2020-02-10 20:12:41,481 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:12:41,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:12:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 345. [2020-02-10 20:12:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:12:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1095 transitions. [2020-02-10 20:12:41,488 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1095 transitions. Word has length 19 [2020-02-10 20:12:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:41,489 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1095 transitions. [2020-02-10 20:12:41,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1095 transitions. [2020-02-10 20:12:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:41,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:41,489 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:41,489 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:41,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2040451274, now seen corresponding path program 117 times [2020-02-10 20:12:41,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:41,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112271562] [2020-02-10 20:12:41,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:41,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112271562] [2020-02-10 20:12:41,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:41,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:41,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958217349] [2020-02-10 20:12:41,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:41,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:41,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:41,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:41,718 INFO L87 Difference]: Start difference. First operand 345 states and 1095 transitions. Second operand 8 states. [2020-02-10 20:12:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:41,797 INFO L93 Difference]: Finished difference Result 655 states and 1847 transitions. [2020-02-10 20:12:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:41,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:41,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:41,799 INFO L225 Difference]: With dead ends: 655 [2020-02-10 20:12:41,799 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:12:41,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:12:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 350. [2020-02-10 20:12:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 20:12:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1105 transitions. [2020-02-10 20:12:41,806 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1105 transitions. Word has length 19 [2020-02-10 20:12:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:41,807 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1105 transitions. [2020-02-10 20:12:41,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1105 transitions. [2020-02-10 20:12:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:41,807 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:41,807 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:41,807 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:41,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:41,808 INFO L82 PathProgramCache]: Analyzing trace with hash 311403940, now seen corresponding path program 118 times [2020-02-10 20:12:41,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:41,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488044724] [2020-02-10 20:12:41,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:42,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488044724] [2020-02-10 20:12:42,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:42,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:42,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724116721] [2020-02-10 20:12:42,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:42,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:42,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:42,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:42,033 INFO L87 Difference]: Start difference. First operand 350 states and 1105 transitions. Second operand 8 states. [2020-02-10 20:12:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:42,111 INFO L93 Difference]: Finished difference Result 661 states and 1861 transitions. [2020-02-10 20:12:42,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:42,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:42,113 INFO L225 Difference]: With dead ends: 661 [2020-02-10 20:12:42,113 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 20:12:42,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 20:12:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 345. [2020-02-10 20:12:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:12:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1091 transitions. [2020-02-10 20:12:42,122 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1091 transitions. Word has length 19 [2020-02-10 20:12:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:42,122 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1091 transitions. [2020-02-10 20:12:42,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1091 transitions. [2020-02-10 20:12:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:42,123 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:42,123 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:42,123 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:42,123 INFO L82 PathProgramCache]: Analyzing trace with hash 945502282, now seen corresponding path program 119 times [2020-02-10 20:12:42,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:42,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997250600] [2020-02-10 20:12:42,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:42,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997250600] [2020-02-10 20:12:42,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:42,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:42,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718756868] [2020-02-10 20:12:42,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:42,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:42,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:42,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:42,317 INFO L87 Difference]: Start difference. First operand 345 states and 1091 transitions. Second operand 8 states. [2020-02-10 20:12:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:42,394 INFO L93 Difference]: Finished difference Result 664 states and 1876 transitions. [2020-02-10 20:12:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:42,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:42,395 INFO L225 Difference]: With dead ends: 664 [2020-02-10 20:12:42,395 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 20:12:42,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 20:12:42,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 353. [2020-02-10 20:12:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-02-10 20:12:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1111 transitions. [2020-02-10 20:12:42,403 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1111 transitions. Word has length 19 [2020-02-10 20:12:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:42,403 INFO L479 AbstractCegarLoop]: Abstraction has 353 states and 1111 transitions. [2020-02-10 20:12:42,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:42,403 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1111 transitions. [2020-02-10 20:12:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:42,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:42,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:42,404 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:42,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:42,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1800808936, now seen corresponding path program 120 times [2020-02-10 20:12:42,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:42,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382459076] [2020-02-10 20:12:42,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:42,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382459076] [2020-02-10 20:12:42,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:42,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:42,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15252290] [2020-02-10 20:12:42,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:42,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:42,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:42,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:42,622 INFO L87 Difference]: Start difference. First operand 353 states and 1111 transitions. Second operand 8 states. [2020-02-10 20:12:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:42,706 INFO L93 Difference]: Finished difference Result 667 states and 1877 transitions. [2020-02-10 20:12:42,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:42,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:42,708 INFO L225 Difference]: With dead ends: 667 [2020-02-10 20:12:42,709 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 20:12:42,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 20:12:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 330. [2020-02-10 20:12:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-02-10 20:12:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1061 transitions. [2020-02-10 20:12:42,716 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1061 transitions. Word has length 19 [2020-02-10 20:12:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:42,716 INFO L479 AbstractCegarLoop]: Abstraction has 330 states and 1061 transitions. [2020-02-10 20:12:42,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1061 transitions. [2020-02-10 20:12:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:42,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:42,717 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:42,717 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:42,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:42,717 INFO L82 PathProgramCache]: Analyzing trace with hash 822861400, now seen corresponding path program 121 times [2020-02-10 20:12:42,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:42,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820883363] [2020-02-10 20:12:42,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:42,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820883363] [2020-02-10 20:12:42,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:42,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:42,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556911277] [2020-02-10 20:12:42,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:42,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:42,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:42,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:42,943 INFO L87 Difference]: Start difference. First operand 330 states and 1061 transitions. Second operand 8 states. [2020-02-10 20:12:43,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:43,014 INFO L93 Difference]: Finished difference Result 685 states and 1929 transitions. [2020-02-10 20:12:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:43,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:43,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:43,015 INFO L225 Difference]: With dead ends: 685 [2020-02-10 20:12:43,016 INFO L226 Difference]: Without dead ends: 654 [2020-02-10 20:12:43,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2020-02-10 20:12:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 346. [2020-02-10 20:12:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:12:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1101 transitions. [2020-02-10 20:12:43,022 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1101 transitions. Word has length 19 [2020-02-10 20:12:43,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:43,022 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1101 transitions. [2020-02-10 20:12:43,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1101 transitions. [2020-02-10 20:12:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:43,023 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:43,023 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:43,023 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:43,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1197512586, now seen corresponding path program 122 times [2020-02-10 20:12:43,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:43,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404413418] [2020-02-10 20:12:43,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:43,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404413418] [2020-02-10 20:12:43,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:43,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:43,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442482494] [2020-02-10 20:12:43,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:43,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:43,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:43,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:43,247 INFO L87 Difference]: Start difference. First operand 346 states and 1101 transitions. Second operand 8 states. [2020-02-10 20:12:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:43,325 INFO L93 Difference]: Finished difference Result 694 states and 1952 transitions. [2020-02-10 20:12:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:43,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:43,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:43,327 INFO L225 Difference]: With dead ends: 694 [2020-02-10 20:12:43,327 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 20:12:43,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:43,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 20:12:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 338. [2020-02-10 20:12:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-02-10 20:12:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1080 transitions. [2020-02-10 20:12:43,335 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1080 transitions. Word has length 19 [2020-02-10 20:12:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:43,335 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 1080 transitions. [2020-02-10 20:12:43,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1080 transitions. [2020-02-10 20:12:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:43,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:43,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:43,336 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:43,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:43,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2004251154, now seen corresponding path program 123 times [2020-02-10 20:12:43,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:43,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490537411] [2020-02-10 20:12:43,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:43,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490537411] [2020-02-10 20:12:43,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:43,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:43,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657041229] [2020-02-10 20:12:43,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:43,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:43,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:43,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:43,557 INFO L87 Difference]: Start difference. First operand 338 states and 1080 transitions. Second operand 8 states. [2020-02-10 20:12:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:43,620 INFO L93 Difference]: Finished difference Result 679 states and 1906 transitions. [2020-02-10 20:12:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:43,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:43,622 INFO L225 Difference]: With dead ends: 679 [2020-02-10 20:12:43,622 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 20:12:43,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 20:12:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 344. [2020-02-10 20:12:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 20:12:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1091 transitions. [2020-02-10 20:12:43,630 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1091 transitions. Word has length 19 [2020-02-10 20:12:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:43,630 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1091 transitions. [2020-02-10 20:12:43,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1091 transitions. [2020-02-10 20:12:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:43,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:43,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:43,631 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:43,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:43,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1028046404, now seen corresponding path program 124 times [2020-02-10 20:12:43,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:43,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230007658] [2020-02-10 20:12:43,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:43,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230007658] [2020-02-10 20:12:43,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:43,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:43,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417751328] [2020-02-10 20:12:43,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:43,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:43,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:43,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:43,846 INFO L87 Difference]: Start difference. First operand 344 states and 1091 transitions. Second operand 8 states. [2020-02-10 20:12:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:43,940 INFO L93 Difference]: Finished difference Result 684 states and 1918 transitions. [2020-02-10 20:12:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:43,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:43,942 INFO L225 Difference]: With dead ends: 684 [2020-02-10 20:12:43,942 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 20:12:43,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 20:12:43,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 338. [2020-02-10 20:12:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-02-10 20:12:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1074 transitions. [2020-02-10 20:12:43,949 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1074 transitions. Word has length 19 [2020-02-10 20:12:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:43,949 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 1074 transitions. [2020-02-10 20:12:43,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1074 transitions. [2020-02-10 20:12:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:43,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:43,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:43,950 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1100948602, now seen corresponding path program 125 times [2020-02-10 20:12:43,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:43,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113538100] [2020-02-10 20:12:43,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:44,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:44,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113538100] [2020-02-10 20:12:44,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:44,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:44,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228968951] [2020-02-10 20:12:44,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:44,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:44,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:44,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:44,175 INFO L87 Difference]: Start difference. First operand 338 states and 1074 transitions. Second operand 8 states. [2020-02-10 20:12:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:44,255 INFO L93 Difference]: Finished difference Result 703 states and 1986 transitions. [2020-02-10 20:12:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:44,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:44,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:44,257 INFO L225 Difference]: With dead ends: 703 [2020-02-10 20:12:44,257 INFO L226 Difference]: Without dead ends: 663 [2020-02-10 20:12:44,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:44,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-02-10 20:12:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 350. [2020-02-10 20:12:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 20:12:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1105 transitions. [2020-02-10 20:12:44,265 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1105 transitions. Word has length 19 [2020-02-10 20:12:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:44,265 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1105 transitions. [2020-02-10 20:12:44,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:44,266 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1105 transitions. [2020-02-10 20:12:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:44,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:44,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:44,267 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:44,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:44,267 INFO L82 PathProgramCache]: Analyzing trace with hash -242668718, now seen corresponding path program 126 times [2020-02-10 20:12:44,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:44,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825704229] [2020-02-10 20:12:44,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:44,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825704229] [2020-02-10 20:12:44,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:44,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:44,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083661935] [2020-02-10 20:12:44,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:44,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:44,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:44,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:44,502 INFO L87 Difference]: Start difference. First operand 350 states and 1105 transitions. Second operand 8 states. [2020-02-10 20:12:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:44,593 INFO L93 Difference]: Finished difference Result 699 states and 1962 transitions. [2020-02-10 20:12:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:44,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:44,595 INFO L225 Difference]: With dead ends: 699 [2020-02-10 20:12:44,595 INFO L226 Difference]: Without dead ends: 643 [2020-02-10 20:12:44,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:44,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-02-10 20:12:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 330. [2020-02-10 20:12:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-02-10 20:12:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1054 transitions. [2020-02-10 20:12:44,602 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1054 transitions. Word has length 19 [2020-02-10 20:12:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:44,602 INFO L479 AbstractCegarLoop]: Abstraction has 330 states and 1054 transitions. [2020-02-10 20:12:44,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1054 transitions. [2020-02-10 20:12:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:44,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:44,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:44,603 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:44,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:44,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1565948490, now seen corresponding path program 127 times [2020-02-10 20:12:44,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:44,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238034549] [2020-02-10 20:12:44,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:44,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238034549] [2020-02-10 20:12:44,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:44,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:44,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063443795] [2020-02-10 20:12:44,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:44,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:44,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:44,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:44,814 INFO L87 Difference]: Start difference. First operand 330 states and 1054 transitions. Second operand 8 states. [2020-02-10 20:12:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:44,875 INFO L93 Difference]: Finished difference Result 676 states and 1893 transitions. [2020-02-10 20:12:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:44,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:44,877 INFO L225 Difference]: With dead ends: 676 [2020-02-10 20:12:44,877 INFO L226 Difference]: Without dead ends: 645 [2020-02-10 20:12:44,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:44,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-02-10 20:12:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 344. [2020-02-10 20:12:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 20:12:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1089 transitions. [2020-02-10 20:12:44,885 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1089 transitions. Word has length 19 [2020-02-10 20:12:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:44,885 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1089 transitions. [2020-02-10 20:12:44,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1089 transitions. [2020-02-10 20:12:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:44,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:44,886 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:44,886 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:44,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:44,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1940599676, now seen corresponding path program 128 times [2020-02-10 20:12:44,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:44,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482654885] [2020-02-10 20:12:44,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:45,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482654885] [2020-02-10 20:12:45,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:45,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:45,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831649067] [2020-02-10 20:12:45,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:45,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:45,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:45,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:45,111 INFO L87 Difference]: Start difference. First operand 344 states and 1089 transitions. Second operand 8 states. [2020-02-10 20:12:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:45,190 INFO L93 Difference]: Finished difference Result 685 states and 1916 transitions. [2020-02-10 20:12:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:45,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:45,191 INFO L225 Difference]: With dead ends: 685 [2020-02-10 20:12:45,192 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 20:12:45,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 20:12:45,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 336. [2020-02-10 20:12:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-02-10 20:12:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1069 transitions. [2020-02-10 20:12:45,201 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1069 transitions. Word has length 19 [2020-02-10 20:12:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:45,201 INFO L479 AbstractCegarLoop]: Abstraction has 336 states and 1069 transitions. [2020-02-10 20:12:45,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1069 transitions. [2020-02-10 20:12:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:45,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:45,202 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:45,202 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1873225276, now seen corresponding path program 129 times [2020-02-10 20:12:45,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:45,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477940282] [2020-02-10 20:12:45,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:45,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477940282] [2020-02-10 20:12:45,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:45,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:45,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839703193] [2020-02-10 20:12:45,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:45,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:45,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:45,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:45,417 INFO L87 Difference]: Start difference. First operand 336 states and 1069 transitions. Second operand 8 states. [2020-02-10 20:12:45,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:45,480 INFO L93 Difference]: Finished difference Result 666 states and 1859 transitions. [2020-02-10 20:12:45,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:45,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:45,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:45,482 INFO L225 Difference]: With dead ends: 666 [2020-02-10 20:12:45,482 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 20:12:45,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:45,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 20:12:45,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 341. [2020-02-10 20:12:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:12:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1078 transitions. [2020-02-10 20:12:45,489 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1078 transitions. Word has length 19 [2020-02-10 20:12:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:45,489 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1078 transitions. [2020-02-10 20:12:45,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1078 transitions. [2020-02-10 20:12:45,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:45,490 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:45,490 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:45,490 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:45,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:45,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1670679926, now seen corresponding path program 130 times [2020-02-10 20:12:45,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:45,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013153239] [2020-02-10 20:12:45,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:45,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013153239] [2020-02-10 20:12:45,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:45,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:45,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918809496] [2020-02-10 20:12:45,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:45,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:45,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:45,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:45,704 INFO L87 Difference]: Start difference. First operand 341 states and 1078 transitions. Second operand 8 states. [2020-02-10 20:12:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:45,799 INFO L93 Difference]: Finished difference Result 668 states and 1863 transitions. [2020-02-10 20:12:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:45,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:45,801 INFO L225 Difference]: With dead ends: 668 [2020-02-10 20:12:45,801 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 20:12:45,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 20:12:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 336. [2020-02-10 20:12:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-02-10 20:12:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1064 transitions. [2020-02-10 20:12:45,808 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1064 transitions. Word has length 19 [2020-02-10 20:12:45,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:45,808 INFO L479 AbstractCegarLoop]: Abstraction has 336 states and 1064 transitions. [2020-02-10 20:12:45,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1064 transitions. [2020-02-10 20:12:45,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:45,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:45,809 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:45,809 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:45,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:45,809 INFO L82 PathProgramCache]: Analyzing trace with hash 400559450, now seen corresponding path program 131 times [2020-02-10 20:12:45,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:45,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154188245] [2020-02-10 20:12:45,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:46,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154188245] [2020-02-10 20:12:46,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:46,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:46,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993881013] [2020-02-10 20:12:46,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:46,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:46,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:46,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:46,019 INFO L87 Difference]: Start difference. First operand 336 states and 1064 transitions. Second operand 8 states. [2020-02-10 20:12:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:46,098 INFO L93 Difference]: Finished difference Result 688 states and 1931 transitions. [2020-02-10 20:12:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:46,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:46,100 INFO L225 Difference]: With dead ends: 688 [2020-02-10 20:12:46,100 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 20:12:46,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:46,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 20:12:46,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 345. [2020-02-10 20:12:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 20:12:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1086 transitions. [2020-02-10 20:12:46,107 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1086 transitions. Word has length 19 [2020-02-10 20:12:46,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:46,107 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1086 transitions. [2020-02-10 20:12:46,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1086 transitions. [2020-02-10 20:12:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:46,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:46,108 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:46,108 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:46,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash 399964804, now seen corresponding path program 132 times [2020-02-10 20:12:46,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:46,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81084604] [2020-02-10 20:12:46,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:46,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81084604] [2020-02-10 20:12:46,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:46,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:46,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91083329] [2020-02-10 20:12:46,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:46,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:46,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:46,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:46,307 INFO L87 Difference]: Start difference. First operand 345 states and 1086 transitions. Second operand 8 states. [2020-02-10 20:12:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:46,387 INFO L93 Difference]: Finished difference Result 681 states and 1901 transitions. [2020-02-10 20:12:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:46,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:46,389 INFO L225 Difference]: With dead ends: 681 [2020-02-10 20:12:46,389 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 20:12:46,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:46,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 20:12:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 330. [2020-02-10 20:12:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-02-10 20:12:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1048 transitions. [2020-02-10 20:12:46,397 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1048 transitions. Word has length 19 [2020-02-10 20:12:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:46,397 INFO L479 AbstractCegarLoop]: Abstraction has 330 states and 1048 transitions. [2020-02-10 20:12:46,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1048 transitions. [2020-02-10 20:12:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:46,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:46,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:46,398 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:46,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash 390118730, now seen corresponding path program 133 times [2020-02-10 20:12:46,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:46,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976666794] [2020-02-10 20:12:46,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:46,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:46,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976666794] [2020-02-10 20:12:46,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:46,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:46,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512196718] [2020-02-10 20:12:46,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:46,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:46,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:46,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:46,616 INFO L87 Difference]: Start difference. First operand 330 states and 1048 transitions. Second operand 8 states. [2020-02-10 20:12:46,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:46,683 INFO L93 Difference]: Finished difference Result 658 states and 1838 transitions. [2020-02-10 20:12:46,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:46,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:46,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:46,685 INFO L225 Difference]: With dead ends: 658 [2020-02-10 20:12:46,685 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 20:12:46,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:46,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 20:12:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 340. [2020-02-10 20:12:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-02-10 20:12:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1076 transitions. [2020-02-10 20:12:46,692 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1076 transitions. Word has length 19 [2020-02-10 20:12:46,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:46,692 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 1076 transitions. [2020-02-10 20:12:46,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1076 transitions. [2020-02-10 20:12:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:46,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:46,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:46,693 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:46,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:46,693 INFO L82 PathProgramCache]: Analyzing trace with hash -360943364, now seen corresponding path program 134 times [2020-02-10 20:12:46,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:46,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110847975] [2020-02-10 20:12:46,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:46,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110847975] [2020-02-10 20:12:46,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:46,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:46,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699015595] [2020-02-10 20:12:46,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:46,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:46,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:46,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:46,901 INFO L87 Difference]: Start difference. First operand 340 states and 1076 transitions. Second operand 8 states. [2020-02-10 20:12:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:46,988 INFO L93 Difference]: Finished difference Result 660 states and 1842 transitions. [2020-02-10 20:12:46,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:46,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:46,989 INFO L225 Difference]: With dead ends: 660 [2020-02-10 20:12:46,990 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 20:12:46,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 20:12:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 335. [2020-02-10 20:12:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-02-10 20:12:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1062 transitions. [2020-02-10 20:12:46,996 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1062 transitions. Word has length 19 [2020-02-10 20:12:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:46,997 INFO L479 AbstractCegarLoop]: Abstraction has 335 states and 1062 transitions. [2020-02-10 20:12:46,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1062 transitions. [2020-02-10 20:12:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:46,997 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:46,997 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:46,997 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:46,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1210319124, now seen corresponding path program 135 times [2020-02-10 20:12:46,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:46,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633325236] [2020-02-10 20:12:46,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:47,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633325236] [2020-02-10 20:12:47,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:47,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:47,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517050573] [2020-02-10 20:12:47,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:47,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:47,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:47,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:47,223 INFO L87 Difference]: Start difference. First operand 335 states and 1062 transitions. Second operand 8 states. [2020-02-10 20:12:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:47,291 INFO L93 Difference]: Finished difference Result 662 states and 1845 transitions. [2020-02-10 20:12:47,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:47,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:47,293 INFO L225 Difference]: With dead ends: 662 [2020-02-10 20:12:47,293 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 20:12:47,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 20:12:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 341. [2020-02-10 20:12:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:12:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1073 transitions. [2020-02-10 20:12:47,301 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1073 transitions. Word has length 19 [2020-02-10 20:12:47,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:47,301 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1073 transitions. [2020-02-10 20:12:47,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1073 transitions. [2020-02-10 20:12:47,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:47,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:47,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:47,302 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:47,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:47,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2108443422, now seen corresponding path program 136 times [2020-02-10 20:12:47,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:47,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015958988] [2020-02-10 20:12:47,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:47,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:47,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015958988] [2020-02-10 20:12:47,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:47,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:47,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182567020] [2020-02-10 20:12:47,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:47,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:47,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:47,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:47,522 INFO L87 Difference]: Start difference. First operand 341 states and 1073 transitions. Second operand 8 states. [2020-02-10 20:12:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:47,620 INFO L93 Difference]: Finished difference Result 667 states and 1857 transitions. [2020-02-10 20:12:47,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:47,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:47,622 INFO L225 Difference]: With dead ends: 667 [2020-02-10 20:12:47,622 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:12:47,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:12:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 335. [2020-02-10 20:12:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-02-10 20:12:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1057 transitions. [2020-02-10 20:12:47,630 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1057 transitions. Word has length 19 [2020-02-10 20:12:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:47,630 INFO L479 AbstractCegarLoop]: Abstraction has 335 states and 1057 transitions. [2020-02-10 20:12:47,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1057 transitions. [2020-02-10 20:12:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:47,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:47,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:47,631 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:47,631 INFO L82 PathProgramCache]: Analyzing trace with hash -558519542, now seen corresponding path program 137 times [2020-02-10 20:12:47,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:47,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136404566] [2020-02-10 20:12:47,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:47,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136404566] [2020-02-10 20:12:47,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:47,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:47,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191566116] [2020-02-10 20:12:47,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:47,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:47,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:47,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:47,850 INFO L87 Difference]: Start difference. First operand 335 states and 1057 transitions. Second operand 8 states. [2020-02-10 20:12:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:47,944 INFO L93 Difference]: Finished difference Result 668 states and 1869 transitions. [2020-02-10 20:12:47,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:47,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:47,946 INFO L225 Difference]: With dead ends: 668 [2020-02-10 20:12:47,946 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 20:12:47,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 20:12:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 343. [2020-02-10 20:12:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 20:12:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1077 transitions. [2020-02-10 20:12:47,952 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1077 transitions. Word has length 19 [2020-02-10 20:12:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:47,953 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1077 transitions. [2020-02-10 20:12:47,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1077 transitions. [2020-02-10 20:12:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:47,954 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:47,954 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:47,954 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:47,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:47,954 INFO L82 PathProgramCache]: Analyzing trace with hash 300354988, now seen corresponding path program 138 times [2020-02-10 20:12:47,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:47,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227549011] [2020-02-10 20:12:47,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:48,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227549011] [2020-02-10 20:12:48,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:48,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:48,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650621572] [2020-02-10 20:12:48,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:48,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:48,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:48,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:48,160 INFO L87 Difference]: Start difference. First operand 343 states and 1077 transitions. Second operand 8 states. [2020-02-10 20:12:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:48,252 INFO L93 Difference]: Finished difference Result 671 states and 1870 transitions. [2020-02-10 20:12:48,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:48,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:48,254 INFO L225 Difference]: With dead ends: 671 [2020-02-10 20:12:48,254 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 20:12:48,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 20:12:48,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 330. [2020-02-10 20:12:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-02-10 20:12:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1043 transitions. [2020-02-10 20:12:48,262 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1043 transitions. Word has length 19 [2020-02-10 20:12:48,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:48,262 INFO L479 AbstractCegarLoop]: Abstraction has 330 states and 1043 transitions. [2020-02-10 20:12:48,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1043 transitions. [2020-02-10 20:12:48,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:48,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:48,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:48,263 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:48,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:48,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2132260642, now seen corresponding path program 139 times [2020-02-10 20:12:48,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:48,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001220607] [2020-02-10 20:12:48,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:48,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001220607] [2020-02-10 20:12:48,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:48,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:48,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135022879] [2020-02-10 20:12:48,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:48,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:48,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:48,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:48,579 INFO L87 Difference]: Start difference. First operand 330 states and 1043 transitions. Second operand 8 states. [2020-02-10 20:12:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:48,663 INFO L93 Difference]: Finished difference Result 702 states and 2000 transitions. [2020-02-10 20:12:48,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:48,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:48,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:48,665 INFO L225 Difference]: With dead ends: 702 [2020-02-10 20:12:48,665 INFO L226 Difference]: Without dead ends: 662 [2020-02-10 20:12:48,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-02-10 20:12:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 347. [2020-02-10 20:12:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:12:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1101 transitions. [2020-02-10 20:12:48,672 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1101 transitions. Word has length 19 [2020-02-10 20:12:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:48,672 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1101 transitions. [2020-02-10 20:12:48,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1101 transitions. [2020-02-10 20:12:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:48,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:48,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:48,673 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:48,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:48,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2132855288, now seen corresponding path program 140 times [2020-02-10 20:12:48,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:48,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516579978] [2020-02-10 20:12:48,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:48,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516579978] [2020-02-10 20:12:48,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:48,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:48,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771899590] [2020-02-10 20:12:48,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:48,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:48,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:48,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:48,875 INFO L87 Difference]: Start difference. First operand 347 states and 1101 transitions. Second operand 8 states. [2020-02-10 20:12:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:48,976 INFO L93 Difference]: Finished difference Result 695 states and 1970 transitions. [2020-02-10 20:12:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:48,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:48,978 INFO L225 Difference]: With dead ends: 695 [2020-02-10 20:12:48,978 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 20:12:48,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 20:12:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 338. [2020-02-10 20:12:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-02-10 20:12:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1071 transitions. [2020-02-10 20:12:48,986 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1071 transitions. Word has length 19 [2020-02-10 20:12:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:48,986 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 1071 transitions. [2020-02-10 20:12:48,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1071 transitions. [2020-02-10 20:12:48,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:48,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:48,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:48,987 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:48,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:48,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1276953988, now seen corresponding path program 141 times [2020-02-10 20:12:48,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:48,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776863545] [2020-02-10 20:12:48,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:49,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776863545] [2020-02-10 20:12:49,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:49,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:49,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900194727] [2020-02-10 20:12:49,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:49,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:49,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:49,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:49,223 INFO L87 Difference]: Start difference. First operand 338 states and 1071 transitions. Second operand 8 states. [2020-02-10 20:12:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:49,312 INFO L93 Difference]: Finished difference Result 708 states and 2013 transitions. [2020-02-10 20:12:49,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:49,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:49,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:49,314 INFO L225 Difference]: With dead ends: 708 [2020-02-10 20:12:49,314 INFO L226 Difference]: Without dead ends: 668 [2020-02-10 20:12:49,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-02-10 20:12:49,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 350. [2020-02-10 20:12:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 20:12:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1102 transitions. [2020-02-10 20:12:49,323 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1102 transitions. Word has length 19 [2020-02-10 20:12:49,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:49,323 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1102 transitions. [2020-02-10 20:12:49,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1102 transitions. [2020-02-10 20:12:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:49,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:49,323 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:49,324 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:49,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:49,324 INFO L82 PathProgramCache]: Analyzing trace with hash -418674104, now seen corresponding path program 142 times [2020-02-10 20:12:49,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:49,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016472022] [2020-02-10 20:12:49,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:49,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016472022] [2020-02-10 20:12:49,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:49,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:49,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545495498] [2020-02-10 20:12:49,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:49,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:49,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:49,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:49,540 INFO L87 Difference]: Start difference. First operand 350 states and 1102 transitions. Second operand 8 states. [2020-02-10 20:12:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:49,636 INFO L93 Difference]: Finished difference Result 704 states and 1989 transitions. [2020-02-10 20:12:49,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:49,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:49,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:49,638 INFO L225 Difference]: With dead ends: 704 [2020-02-10 20:12:49,638 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 20:12:49,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:49,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 20:12:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 338. [2020-02-10 20:12:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-02-10 20:12:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1063 transitions. [2020-02-10 20:12:49,647 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1063 transitions. Word has length 19 [2020-02-10 20:12:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:49,648 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 1063 transitions. [2020-02-10 20:12:49,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1063 transitions. [2020-02-10 20:12:49,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:49,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:49,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:49,649 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:49,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:49,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1295982660, now seen corresponding path program 143 times [2020-02-10 20:12:49,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:49,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081092385] [2020-02-10 20:12:49,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:49,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081092385] [2020-02-10 20:12:49,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:49,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:49,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118604156] [2020-02-10 20:12:49,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:49,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:49,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:49,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:49,869 INFO L87 Difference]: Start difference. First operand 338 states and 1063 transitions. Second operand 8 states. [2020-02-10 20:12:49,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:49,955 INFO L93 Difference]: Finished difference Result 690 states and 1948 transitions. [2020-02-10 20:12:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:49,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:49,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:49,957 INFO L225 Difference]: With dead ends: 690 [2020-02-10 20:12:49,958 INFO L226 Difference]: Without dead ends: 657 [2020-02-10 20:12:49,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-02-10 20:12:49,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 346. [2020-02-10 20:12:49,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 20:12:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1083 transitions. [2020-02-10 20:12:49,965 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1083 transitions. Word has length 19 [2020-02-10 20:12:49,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:49,965 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1083 transitions. [2020-02-10 20:12:49,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1083 transitions. [2020-02-10 20:12:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:49,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:49,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:49,966 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash -437108130, now seen corresponding path program 144 times [2020-02-10 20:12:49,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:49,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975443404] [2020-02-10 20:12:49,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:50,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975443404] [2020-02-10 20:12:50,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:50,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:50,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93926220] [2020-02-10 20:12:50,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:50,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:50,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:50,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:50,168 INFO L87 Difference]: Start difference. First operand 346 states and 1083 transitions. Second operand 8 states. [2020-02-10 20:12:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:50,259 INFO L93 Difference]: Finished difference Result 693 states and 1949 transitions. [2020-02-10 20:12:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:50,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:50,261 INFO L225 Difference]: With dead ends: 693 [2020-02-10 20:12:50,261 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 20:12:50,262 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 20:12:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 322. [2020-02-10 20:12:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-02-10 20:12:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 1025 transitions. [2020-02-10 20:12:50,269 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 1025 transitions. Word has length 19 [2020-02-10 20:12:50,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:50,269 INFO L479 AbstractCegarLoop]: Abstraction has 322 states and 1025 transitions. [2020-02-10 20:12:50,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 1025 transitions. [2020-02-10 20:12:50,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:50,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:50,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:50,270 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:50,270 INFO L82 PathProgramCache]: Analyzing trace with hash -570692880, now seen corresponding path program 145 times [2020-02-10 20:12:50,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:50,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300484627] [2020-02-10 20:12:50,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:50,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:50,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300484627] [2020-02-10 20:12:50,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:50,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:50,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099869381] [2020-02-10 20:12:50,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:50,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:50,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:50,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:50,487 INFO L87 Difference]: Start difference. First operand 322 states and 1025 transitions. Second operand 8 states. [2020-02-10 20:12:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:50,564 INFO L93 Difference]: Finished difference Result 656 states and 1808 transitions. [2020-02-10 20:12:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:50,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:50,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:50,566 INFO L225 Difference]: With dead ends: 656 [2020-02-10 20:12:50,566 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 20:12:50,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 20:12:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 343. [2020-02-10 20:12:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 20:12:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1083 transitions. [2020-02-10 20:12:50,575 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1083 transitions. Word has length 19 [2020-02-10 20:12:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:50,576 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1083 transitions. [2020-02-10 20:12:50,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1083 transitions. [2020-02-10 20:12:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:50,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:50,577 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:50,577 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:50,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:50,577 INFO L82 PathProgramCache]: Analyzing trace with hash -196041694, now seen corresponding path program 146 times [2020-02-10 20:12:50,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:50,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726545983] [2020-02-10 20:12:50,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:50,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:50,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726545983] [2020-02-10 20:12:50,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:50,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:50,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008086566] [2020-02-10 20:12:50,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:50,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:50,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:50,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:50,808 INFO L87 Difference]: Start difference. First operand 343 states and 1083 transitions. Second operand 8 states. [2020-02-10 20:12:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:50,892 INFO L93 Difference]: Finished difference Result 665 states and 1831 transitions. [2020-02-10 20:12:50,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:50,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:50,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:50,893 INFO L225 Difference]: With dead ends: 665 [2020-02-10 20:12:50,894 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 20:12:50,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:50,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 20:12:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 335. [2020-02-10 20:12:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-02-10 20:12:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1062 transitions. [2020-02-10 20:12:50,901 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1062 transitions. Word has length 19 [2020-02-10 20:12:50,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:50,901 INFO L479 AbstractCegarLoop]: Abstraction has 335 states and 1062 transitions. [2020-02-10 20:12:50,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1062 transitions. [2020-02-10 20:12:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:50,901 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:50,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:50,902 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:50,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:50,902 INFO L82 PathProgramCache]: Analyzing trace with hash 610696874, now seen corresponding path program 147 times [2020-02-10 20:12:50,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:50,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802822777] [2020-02-10 20:12:50,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:51,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802822777] [2020-02-10 20:12:51,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:51,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:51,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693239339] [2020-02-10 20:12:51,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:51,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:51,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:51,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:51,112 INFO L87 Difference]: Start difference. First operand 335 states and 1062 transitions. Second operand 8 states. [2020-02-10 20:12:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:51,182 INFO L93 Difference]: Finished difference Result 650 states and 1785 transitions. [2020-02-10 20:12:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:51,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:51,184 INFO L225 Difference]: With dead ends: 650 [2020-02-10 20:12:51,184 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 20:12:51,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 20:12:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 341. [2020-02-10 20:12:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 20:12:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1073 transitions. [2020-02-10 20:12:51,192 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1073 transitions. Word has length 19 [2020-02-10 20:12:51,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:51,192 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1073 transitions. [2020-02-10 20:12:51,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:51,192 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1073 transitions. [2020-02-10 20:12:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:51,192 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:51,192 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:51,193 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:51,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:51,193 INFO L82 PathProgramCache]: Analyzing trace with hash -365507876, now seen corresponding path program 148 times [2020-02-10 20:12:51,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:51,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156714336] [2020-02-10 20:12:51,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:51,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156714336] [2020-02-10 20:12:51,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:51,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:51,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547361851] [2020-02-10 20:12:51,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:51,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:51,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:51,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:51,400 INFO L87 Difference]: Start difference. First operand 341 states and 1073 transitions. Second operand 8 states. [2020-02-10 20:12:51,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:51,509 INFO L93 Difference]: Finished difference Result 655 states and 1797 transitions. [2020-02-10 20:12:51,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:51,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:51,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:51,510 INFO L225 Difference]: With dead ends: 655 [2020-02-10 20:12:51,510 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 20:12:51,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 20:12:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 335. [2020-02-10 20:12:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-02-10 20:12:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1056 transitions. [2020-02-10 20:12:51,520 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1056 transitions. Word has length 19 [2020-02-10 20:12:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:51,520 INFO L479 AbstractCegarLoop]: Abstraction has 335 states and 1056 transitions. [2020-02-10 20:12:51,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1056 transitions. [2020-02-10 20:12:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:51,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:51,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:51,522 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:51,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1800464414, now seen corresponding path program 149 times [2020-02-10 20:12:51,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:51,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434955301] [2020-02-10 20:12:51,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:51,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434955301] [2020-02-10 20:12:51,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:51,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:51,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936978132] [2020-02-10 20:12:51,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:51,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:51,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:51,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:51,760 INFO L87 Difference]: Start difference. First operand 335 states and 1056 transitions. Second operand 8 states. [2020-02-10 20:12:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:51,855 INFO L93 Difference]: Finished difference Result 674 states and 1865 transitions. [2020-02-10 20:12:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:51,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:51,857 INFO L225 Difference]: With dead ends: 674 [2020-02-10 20:12:51,857 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 20:12:51,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 20:12:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 347. [2020-02-10 20:12:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 20:12:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1087 transitions. [2020-02-10 20:12:51,864 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1087 transitions. Word has length 19 [2020-02-10 20:12:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:51,864 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1087 transitions. [2020-02-10 20:12:51,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1087 transitions. [2020-02-10 20:12:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:51,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:51,864 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:51,865 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1636222998, now seen corresponding path program 150 times [2020-02-10 20:12:51,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:51,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814036085] [2020-02-10 20:12:51,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:52,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814036085] [2020-02-10 20:12:52,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:52,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:52,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552817547] [2020-02-10 20:12:52,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:52,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:52,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:52,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:52,093 INFO L87 Difference]: Start difference. First operand 347 states and 1087 transitions. Second operand 8 states. [2020-02-10 20:12:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:52,187 INFO L93 Difference]: Finished difference Result 670 states and 1841 transitions. [2020-02-10 20:12:52,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:52,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:52,189 INFO L225 Difference]: With dead ends: 670 [2020-02-10 20:12:52,189 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 20:12:52,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:52,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 20:12:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 327. [2020-02-10 20:12:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-02-10 20:12:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 1038 transitions. [2020-02-10 20:12:52,198 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 1038 transitions. Word has length 19 [2020-02-10 20:12:52,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:52,198 INFO L479 AbstractCegarLoop]: Abstraction has 327 states and 1038 transitions. [2020-02-10 20:12:52,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 1038 transitions. [2020-02-10 20:12:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:52,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:52,199 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:52,199 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:52,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:52,199 INFO L82 PathProgramCache]: Analyzing trace with hash 807035554, now seen corresponding path program 151 times [2020-02-10 20:12:52,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:52,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086077395] [2020-02-10 20:12:52,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:52,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086077395] [2020-02-10 20:12:52,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:52,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:52,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185197896] [2020-02-10 20:12:52,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:52,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:52,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:52,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:52,415 INFO L87 Difference]: Start difference. First operand 327 states and 1038 transitions. Second operand 8 states. [2020-02-10 20:12:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:52,484 INFO L93 Difference]: Finished difference Result 629 states and 1714 transitions. [2020-02-10 20:12:52,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:52,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:52,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:52,486 INFO L225 Difference]: With dead ends: 629 [2020-02-10 20:12:52,486 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 20:12:52,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 20:12:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 339. [2020-02-10 20:12:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-02-10 20:12:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1064 transitions. [2020-02-10 20:12:52,493 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1064 transitions. Word has length 19 [2020-02-10 20:12:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:52,493 INFO L479 AbstractCegarLoop]: Abstraction has 339 states and 1064 transitions. [2020-02-10 20:12:52,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1064 transitions. [2020-02-10 20:12:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:52,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:52,494 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:52,494 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1181686740, now seen corresponding path program 152 times [2020-02-10 20:12:52,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:52,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000762187] [2020-02-10 20:12:52,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:52,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000762187] [2020-02-10 20:12:52,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:52,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:52,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846743883] [2020-02-10 20:12:52,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:52,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:52,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:52,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:52,698 INFO L87 Difference]: Start difference. First operand 339 states and 1064 transitions. Second operand 8 states. [2020-02-10 20:12:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:52,778 INFO L93 Difference]: Finished difference Result 638 states and 1737 transitions. [2020-02-10 20:12:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:52,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:52,780 INFO L225 Difference]: With dead ends: 638 [2020-02-10 20:12:52,780 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 20:12:52,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 20:12:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 331. [2020-02-10 20:12:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-02-10 20:12:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1046 transitions. [2020-02-10 20:12:52,787 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 1046 transitions. Word has length 19 [2020-02-10 20:12:52,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:52,787 INFO L479 AbstractCegarLoop]: Abstraction has 331 states and 1046 transitions. [2020-02-10 20:12:52,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 1046 transitions. [2020-02-10 20:12:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:52,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:52,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:52,788 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:52,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:52,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1337232860, now seen corresponding path program 153 times [2020-02-10 20:12:52,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:52,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275855409] [2020-02-10 20:12:52,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:52,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275855409] [2020-02-10 20:12:52,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:52,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:52,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483615368] [2020-02-10 20:12:52,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:52,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:52,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:52,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:52,973 INFO L87 Difference]: Start difference. First operand 331 states and 1046 transitions. Second operand 8 states. [2020-02-10 20:12:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:53,043 INFO L93 Difference]: Finished difference Result 606 states and 1650 transitions. [2020-02-10 20:12:53,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:53,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:53,045 INFO L225 Difference]: With dead ends: 606 [2020-02-10 20:12:53,045 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 20:12:53,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 20:12:53,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 334. [2020-02-10 20:12:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-02-10 20:12:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1050 transitions. [2020-02-10 20:12:53,053 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1050 transitions. Word has length 19 [2020-02-10 20:12:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:53,053 INFO L479 AbstractCegarLoop]: Abstraction has 334 states and 1050 transitions. [2020-02-10 20:12:53,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1050 transitions. [2020-02-10 20:12:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:53,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:53,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:53,054 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:53,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1693132272, now seen corresponding path program 1 times [2020-02-10 20:12:53,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:53,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842697663] [2020-02-10 20:12:53,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:53,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842697663] [2020-02-10 20:12:53,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:53,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:53,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153068800] [2020-02-10 20:12:53,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:53,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:53,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:53,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:53,064 INFO L87 Difference]: Start difference. First operand 334 states and 1050 transitions. Second operand 3 states. [2020-02-10 20:12:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:53,068 INFO L93 Difference]: Finished difference Result 220 states and 662 transitions. [2020-02-10 20:12:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:53,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-02-10 20:12:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:53,069 INFO L225 Difference]: With dead ends: 220 [2020-02-10 20:12:53,069 INFO L226 Difference]: Without dead ends: 220 [2020-02-10 20:12:53,069 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:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-02-10 20:12:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2020-02-10 20:12:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 20:12:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 662 transitions. [2020-02-10 20:12:53,072 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 662 transitions. Word has length 19 [2020-02-10 20:12:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:53,073 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 662 transitions. [2020-02-10 20:12:53,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 662 transitions. [2020-02-10 20:12:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:53,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:53,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:53,073 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1596291086, now seen corresponding path program 154 times [2020-02-10 20:12:53,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:53,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481566489] [2020-02-10 20:12:53,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:53,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:53,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481566489] [2020-02-10 20:12:53,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:53,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:53,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016815828] [2020-02-10 20:12:53,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:53,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:53,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:53,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:53,268 INFO L87 Difference]: Start difference. First operand 220 states and 662 transitions. Second operand 8 states. [2020-02-10 20:12:53,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:53,332 INFO L93 Difference]: Finished difference Result 336 states and 884 transitions. [2020-02-10 20:12:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:53,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:53,333 INFO L225 Difference]: With dead ends: 336 [2020-02-10 20:12:53,333 INFO L226 Difference]: Without dead ends: 323 [2020-02-10 20:12:53,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-02-10 20:12:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 217. [2020-02-10 20:12:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:12:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 655 transitions. [2020-02-10 20:12:53,339 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 655 transitions. Word has length 19 [2020-02-10 20:12:53,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:53,339 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 655 transitions. [2020-02-10 20:12:53,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 655 transitions. [2020-02-10 20:12:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:53,340 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:53,340 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:53,340 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:53,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:53,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1035428716, now seen corresponding path program 155 times [2020-02-10 20:12:53,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:53,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724577185] [2020-02-10 20:12:53,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:53,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724577185] [2020-02-10 20:12:53,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:53,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:53,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847986912] [2020-02-10 20:12:53,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:53,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:53,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:53,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:53,538 INFO L87 Difference]: Start difference. First operand 217 states and 655 transitions. Second operand 8 states. [2020-02-10 20:12:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:53,634 INFO L93 Difference]: Finished difference Result 348 states and 900 transitions. [2020-02-10 20:12:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:53,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:53,635 INFO L225 Difference]: With dead ends: 348 [2020-02-10 20:12:53,635 INFO L226 Difference]: Without dead ends: 334 [2020-02-10 20:12:53,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-02-10 20:12:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 219. [2020-02-10 20:12:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 20:12:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 658 transitions. [2020-02-10 20:12:53,641 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 658 transitions. Word has length 19 [2020-02-10 20:12:53,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:53,641 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 658 transitions. [2020-02-10 20:12:53,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 658 transitions. [2020-02-10 20:12:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:53,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:53,642 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:53,642 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:53,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:53,642 INFO L82 PathProgramCache]: Analyzing trace with hash 84701114, now seen corresponding path program 156 times [2020-02-10 20:12:53,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:53,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930027879] [2020-02-10 20:12:53,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:53,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930027879] [2020-02-10 20:12:53,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:53,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:53,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102268902] [2020-02-10 20:12:53,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:53,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:53,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:53,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:53,845 INFO L87 Difference]: Start difference. First operand 219 states and 658 transitions. Second operand 8 states. [2020-02-10 20:12:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:53,908 INFO L93 Difference]: Finished difference Result 335 states and 880 transitions. [2020-02-10 20:12:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:53,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:53,910 INFO L225 Difference]: With dead ends: 335 [2020-02-10 20:12:53,910 INFO L226 Difference]: Without dead ends: 319 [2020-02-10 20:12:53,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-02-10 20:12:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 213. [2020-02-10 20:12:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-02-10 20:12:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 646 transitions. [2020-02-10 20:12:53,915 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 646 transitions. Word has length 19 [2020-02-10 20:12:53,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:53,915 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 646 transitions. [2020-02-10 20:12:53,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 646 transitions. [2020-02-10 20:12:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:53,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:53,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:53,916 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:53,916 INFO L82 PathProgramCache]: Analyzing trace with hash -694390430, now seen corresponding path program 157 times [2020-02-10 20:12:53,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:53,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674008404] [2020-02-10 20:12:53,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:54,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674008404] [2020-02-10 20:12:54,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:54,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:54,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272014053] [2020-02-10 20:12:54,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:54,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:54,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:54,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:54,112 INFO L87 Difference]: Start difference. First operand 213 states and 646 transitions. Second operand 8 states. [2020-02-10 20:12:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:54,189 INFO L93 Difference]: Finished difference Result 363 states and 936 transitions. [2020-02-10 20:12:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:54,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:54,190 INFO L225 Difference]: With dead ends: 363 [2020-02-10 20:12:54,190 INFO L226 Difference]: Without dead ends: 347 [2020-02-10 20:12:54,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-02-10 20:12:54,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 219. [2020-02-10 20:12:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 20:12:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 660 transitions. [2020-02-10 20:12:54,195 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 660 transitions. Word has length 19 [2020-02-10 20:12:54,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:54,195 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 660 transitions. [2020-02-10 20:12:54,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 660 transitions. [2020-02-10 20:12:54,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:54,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:54,196 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:54,196 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:54,196 INFO L82 PathProgramCache]: Analyzing trace with hash -435332204, now seen corresponding path program 158 times [2020-02-10 20:12:54,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:54,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416972513] [2020-02-10 20:12:54,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:54,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416972513] [2020-02-10 20:12:54,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:54,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:54,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760262240] [2020-02-10 20:12:54,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:54,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:54,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:54,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:54,401 INFO L87 Difference]: Start difference. First operand 219 states and 660 transitions. Second operand 8 states. [2020-02-10 20:12:54,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:54,466 INFO L93 Difference]: Finished difference Result 357 states and 921 transitions. [2020-02-10 20:12:54,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:54,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:54,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:54,468 INFO L225 Difference]: With dead ends: 357 [2020-02-10 20:12:54,468 INFO L226 Difference]: Without dead ends: 344 [2020-02-10 20:12:54,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-02-10 20:12:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 216. [2020-02-10 20:12:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:12:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 653 transitions. [2020-02-10 20:12:54,474 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 653 transitions. Word has length 19 [2020-02-10 20:12:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:54,474 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 653 transitions. [2020-02-10 20:12:54,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 653 transitions. [2020-02-10 20:12:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:54,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:54,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:54,475 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:54,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:54,475 INFO L82 PathProgramCache]: Analyzing trace with hash 399701158, now seen corresponding path program 159 times [2020-02-10 20:12:54,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:54,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658777620] [2020-02-10 20:12:54,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:54,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658777620] [2020-02-10 20:12:54,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:54,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:54,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973526038] [2020-02-10 20:12:54,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:54,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:54,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:54,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:54,675 INFO L87 Difference]: Start difference. First operand 216 states and 653 transitions. Second operand 8 states. [2020-02-10 20:12:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:54,745 INFO L93 Difference]: Finished difference Result 363 states and 933 transitions. [2020-02-10 20:12:54,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:54,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:54,746 INFO L225 Difference]: With dead ends: 363 [2020-02-10 20:12:54,746 INFO L226 Difference]: Without dead ends: 347 [2020-02-10 20:12:54,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-02-10 20:12:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 222. [2020-02-10 20:12:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-02-10 20:12:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 664 transitions. [2020-02-10 20:12:54,751 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 664 transitions. Word has length 19 [2020-02-10 20:12:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:54,751 INFO L479 AbstractCegarLoop]: Abstraction has 222 states and 664 transitions. [2020-02-10 20:12:54,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 664 transitions. [2020-02-10 20:12:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:54,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:54,752 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:54,752 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:54,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:54,752 INFO L82 PathProgramCache]: Analyzing trace with hash -576503592, now seen corresponding path program 160 times [2020-02-10 20:12:54,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:54,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393823132] [2020-02-10 20:12:54,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:54,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393823132] [2020-02-10 20:12:54,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:54,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:54,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715625736] [2020-02-10 20:12:54,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:54,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:54,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:54,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:54,948 INFO L87 Difference]: Start difference. First operand 222 states and 664 transitions. Second operand 8 states. [2020-02-10 20:12:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:55,044 INFO L93 Difference]: Finished difference Result 360 states and 922 transitions. [2020-02-10 20:12:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:55,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:55,045 INFO L225 Difference]: With dead ends: 360 [2020-02-10 20:12:55,045 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 20:12:55,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:55,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 20:12:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 216. [2020-02-10 20:12:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:12:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 650 transitions. [2020-02-10 20:12:55,050 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 650 transitions. Word has length 19 [2020-02-10 20:12:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:55,050 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 650 transitions. [2020-02-10 20:12:55,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 650 transitions. [2020-02-10 20:12:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:55,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:55,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:55,051 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:55,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1883903552, now seen corresponding path program 161 times [2020-02-10 20:12:55,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:55,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836726564] [2020-02-10 20:12:55,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:55,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836726564] [2020-02-10 20:12:55,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:55,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:55,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095485491] [2020-02-10 20:12:55,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:55,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:55,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:55,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:55,253 INFO L87 Difference]: Start difference. First operand 216 states and 650 transitions. Second operand 8 states. [2020-02-10 20:12:55,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:55,316 INFO L93 Difference]: Finished difference Result 347 states and 894 transitions. [2020-02-10 20:12:55,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:55,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:55,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:55,318 INFO L225 Difference]: With dead ends: 347 [2020-02-10 20:12:55,318 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 20:12:55,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 20:12:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 218. [2020-02-10 20:12:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:12:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 653 transitions. [2020-02-10 20:12:55,324 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 653 transitions. Word has length 19 [2020-02-10 20:12:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:55,324 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 653 transitions. [2020-02-10 20:12:55,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 653 transitions. [2020-02-10 20:12:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:55,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:55,325 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:55,325 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:55,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:55,325 INFO L82 PathProgramCache]: Analyzing trace with hash -394498556, now seen corresponding path program 162 times [2020-02-10 20:12:55,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:55,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95889862] [2020-02-10 20:12:55,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:55,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:55,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95889862] [2020-02-10 20:12:55,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:55,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:55,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699170313] [2020-02-10 20:12:55,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:55,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:55,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:55,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:55,521 INFO L87 Difference]: Start difference. First operand 218 states and 653 transitions. Second operand 8 states. [2020-02-10 20:12:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:55,609 INFO L93 Difference]: Finished difference Result 345 states and 889 transitions. [2020-02-10 20:12:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:55,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:55,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:55,611 INFO L225 Difference]: With dead ends: 345 [2020-02-10 20:12:55,611 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 20:12:55,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 20:12:55,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 213. [2020-02-10 20:12:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-02-10 20:12:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 643 transitions. [2020-02-10 20:12:55,616 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 643 transitions. Word has length 19 [2020-02-10 20:12:55,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:55,616 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 643 transitions. [2020-02-10 20:12:55,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 643 transitions. [2020-02-10 20:12:55,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:55,617 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:55,617 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:55,617 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:55,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash 600573882, now seen corresponding path program 163 times [2020-02-10 20:12:55,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:55,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747050954] [2020-02-10 20:12:55,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:55,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747050954] [2020-02-10 20:12:55,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:55,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:55,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685101987] [2020-02-10 20:12:55,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:55,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:55,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:55,823 INFO L87 Difference]: Start difference. First operand 213 states and 643 transitions. Second operand 8 states. [2020-02-10 20:12:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:55,908 INFO L93 Difference]: Finished difference Result 353 states and 915 transitions. [2020-02-10 20:12:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:55,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:55,909 INFO L225 Difference]: With dead ends: 353 [2020-02-10 20:12:55,909 INFO L226 Difference]: Without dead ends: 339 [2020-02-10 20:12:55,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-02-10 20:12:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 217. [2020-02-10 20:12:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:12:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 653 transitions. [2020-02-10 20:12:55,915 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 653 transitions. Word has length 19 [2020-02-10 20:12:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:55,915 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 653 transitions. [2020-02-10 20:12:55,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 653 transitions. [2020-02-10 20:12:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:55,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:55,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:55,916 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1720703712, now seen corresponding path program 164 times [2020-02-10 20:12:55,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:55,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244304836] [2020-02-10 20:12:55,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:56,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244304836] [2020-02-10 20:12:56,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:56,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:56,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647252734] [2020-02-10 20:12:56,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:56,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:56,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:56,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:56,114 INFO L87 Difference]: Start difference. First operand 217 states and 653 transitions. Second operand 8 states. [2020-02-10 20:12:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:56,190 INFO L93 Difference]: Finished difference Result 349 states and 904 transitions. [2020-02-10 20:12:56,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:56,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:56,191 INFO L225 Difference]: With dead ends: 349 [2020-02-10 20:12:56,191 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 20:12:56,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 20:12:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 215. [2020-02-10 20:12:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:12:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 648 transitions. [2020-02-10 20:12:56,196 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 648 transitions. Word has length 19 [2020-02-10 20:12:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:56,196 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 648 transitions. [2020-02-10 20:12:56,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 648 transitions. [2020-02-10 20:12:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:56,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:56,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:56,197 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:56,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:56,197 INFO L82 PathProgramCache]: Analyzing trace with hash -472511498, now seen corresponding path program 165 times [2020-02-10 20:12:56,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:56,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205165039] [2020-02-10 20:12:56,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:56,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:56,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205165039] [2020-02-10 20:12:56,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:56,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:56,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730907271] [2020-02-10 20:12:56,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:56,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:56,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:56,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:56,399 INFO L87 Difference]: Start difference. First operand 215 states and 648 transitions. Second operand 8 states. [2020-02-10 20:12:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:56,480 INFO L93 Difference]: Finished difference Result 354 states and 915 transitions. [2020-02-10 20:12:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:56,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:56,481 INFO L225 Difference]: With dead ends: 354 [2020-02-10 20:12:56,482 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 20:12:56,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:56,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 20:12:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 220. [2020-02-10 20:12:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 20:12:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 658 transitions. [2020-02-10 20:12:56,487 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 658 transitions. Word has length 19 [2020-02-10 20:12:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:56,487 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 658 transitions. [2020-02-10 20:12:56,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:56,487 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 658 transitions. [2020-02-10 20:12:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:56,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:56,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:56,488 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:56,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:56,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1114568416, now seen corresponding path program 166 times [2020-02-10 20:12:56,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:56,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390007450] [2020-02-10 20:12:56,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:56,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390007450] [2020-02-10 20:12:56,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:56,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:56,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781251124] [2020-02-10 20:12:56,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:56,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:56,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:56,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:56,689 INFO L87 Difference]: Start difference. First operand 220 states and 658 transitions. Second operand 8 states. [2020-02-10 20:12:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:56,772 INFO L93 Difference]: Finished difference Result 353 states and 908 transitions. [2020-02-10 20:12:56,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:56,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:56,773 INFO L225 Difference]: With dead ends: 353 [2020-02-10 20:12:56,773 INFO L226 Difference]: Without dead ends: 335 [2020-02-10 20:12:56,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-02-10 20:12:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2020-02-10 20:12:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:12:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 646 transitions. [2020-02-10 20:12:56,779 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 646 transitions. Word has length 19 [2020-02-10 20:12:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:56,779 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 646 transitions. [2020-02-10 20:12:56,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 646 transitions. [2020-02-10 20:12:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:56,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:56,780 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:56,780 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:56,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:56,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1498552428, now seen corresponding path program 167 times [2020-02-10 20:12:56,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:56,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072853752] [2020-02-10 20:12:56,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:56,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072853752] [2020-02-10 20:12:56,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:56,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:56,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377043394] [2020-02-10 20:12:56,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:56,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:56,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:56,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:56,982 INFO L87 Difference]: Start difference. First operand 215 states and 646 transitions. Second operand 8 states. [2020-02-10 20:12:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:57,059 INFO L93 Difference]: Finished difference Result 343 states and 885 transitions. [2020-02-10 20:12:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:57,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:57,061 INFO L225 Difference]: With dead ends: 343 [2020-02-10 20:12:57,061 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 20:12:57,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:57,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 20:12:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 217. [2020-02-10 20:12:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:12:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 649 transitions. [2020-02-10 20:12:57,066 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 649 transitions. Word has length 19 [2020-02-10 20:12:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:57,066 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 649 transitions. [2020-02-10 20:12:57,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:57,066 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 649 transitions. [2020-02-10 20:12:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:57,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:57,066 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:57,067 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:57,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:57,067 INFO L82 PathProgramCache]: Analyzing trace with hash -9147432, now seen corresponding path program 168 times [2020-02-10 20:12:57,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:57,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459533866] [2020-02-10 20:12:57,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:57,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459533866] [2020-02-10 20:12:57,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:57,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:57,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192583813] [2020-02-10 20:12:57,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:57,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:57,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:57,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:57,277 INFO L87 Difference]: Start difference. First operand 217 states and 649 transitions. Second operand 8 states. [2020-02-10 20:12:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:57,362 INFO L93 Difference]: Finished difference Result 341 states and 880 transitions. [2020-02-10 20:12:57,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:57,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:57,363 INFO L225 Difference]: With dead ends: 341 [2020-02-10 20:12:57,364 INFO L226 Difference]: Without dead ends: 319 [2020-02-10 20:12:57,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-02-10 20:12:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 208. [2020-02-10 20:12:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 20:12:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 632 transitions. [2020-02-10 20:12:57,368 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 632 transitions. Word has length 19 [2020-02-10 20:12:57,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:57,368 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 632 transitions. [2020-02-10 20:12:57,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:57,368 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 632 transitions. [2020-02-10 20:12:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:57,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:57,369 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:57,369 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:57,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:57,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1927068432, now seen corresponding path program 169 times [2020-02-10 20:12:57,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:57,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208895903] [2020-02-10 20:12:57,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:57,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208895903] [2020-02-10 20:12:57,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:57,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:57,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542927032] [2020-02-10 20:12:57,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:57,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:57,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:57,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:57,646 INFO L87 Difference]: Start difference. First operand 208 states and 632 transitions. Second operand 8 states. [2020-02-10 20:12:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:57,706 INFO L93 Difference]: Finished difference Result 378 states and 982 transitions. [2020-02-10 20:12:57,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:57,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:57,707 INFO L225 Difference]: With dead ends: 378 [2020-02-10 20:12:57,707 INFO L226 Difference]: Without dead ends: 362 [2020-02-10 20:12:57,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-02-10 20:12:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 224. [2020-02-10 20:12:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-02-10 20:12:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 674 transitions. [2020-02-10 20:12:57,713 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 674 transitions. Word has length 19 [2020-02-10 20:12:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:57,713 INFO L479 AbstractCegarLoop]: Abstraction has 224 states and 674 transitions. [2020-02-10 20:12:57,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 674 transitions. [2020-02-10 20:12:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:57,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:57,714 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:57,714 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:57,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1552417246, now seen corresponding path program 170 times [2020-02-10 20:12:57,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:57,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686917893] [2020-02-10 20:12:57,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:57,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686917893] [2020-02-10 20:12:57,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:57,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:57,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092982470] [2020-02-10 20:12:57,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:57,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:57,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:57,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:57,919 INFO L87 Difference]: Start difference. First operand 224 states and 674 transitions. Second operand 8 states. [2020-02-10 20:12:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:57,999 INFO L93 Difference]: Finished difference Result 376 states and 972 transitions. [2020-02-10 20:12:57,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:57,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:57,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:58,000 INFO L225 Difference]: With dead ends: 376 [2020-02-10 20:12:58,000 INFO L226 Difference]: Without dead ends: 354 [2020-02-10 20:12:58,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-02-10 20:12:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 216. [2020-02-10 20:12:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:12:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 656 transitions. [2020-02-10 20:12:58,005 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 656 transitions. Word has length 19 [2020-02-10 20:12:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:58,005 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 656 transitions. [2020-02-10 20:12:58,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 656 transitions. [2020-02-10 20:12:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:58,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:58,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:58,006 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:58,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:58,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1396871126, now seen corresponding path program 171 times [2020-02-10 20:12:58,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:58,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641419523] [2020-02-10 20:12:58,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:58,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641419523] [2020-02-10 20:12:58,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:58,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:58,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102848337] [2020-02-10 20:12:58,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:58,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:58,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:58,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:58,192 INFO L87 Difference]: Start difference. First operand 216 states and 656 transitions. Second operand 8 states. [2020-02-10 20:12:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:58,259 INFO L93 Difference]: Finished difference Result 369 states and 955 transitions. [2020-02-10 20:12:58,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:58,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:58,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:58,261 INFO L225 Difference]: With dead ends: 369 [2020-02-10 20:12:58,261 INFO L226 Difference]: Without dead ends: 353 [2020-02-10 20:12:58,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:58,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-02-10 20:12:58,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 219. [2020-02-10 20:12:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 20:12:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 660 transitions. [2020-02-10 20:12:58,267 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 660 transitions. Word has length 19 [2020-02-10 20:12:58,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:58,267 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 660 transitions. [2020-02-10 20:12:58,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 660 transitions. [2020-02-10 20:12:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:58,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:58,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:58,268 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1137812900, now seen corresponding path program 172 times [2020-02-10 20:12:58,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:58,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611953225] [2020-02-10 20:12:58,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:58,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611953225] [2020-02-10 20:12:58,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:58,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:58,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635217689] [2020-02-10 20:12:58,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:58,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:58,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:58,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:58,519 INFO L87 Difference]: Start difference. First operand 219 states and 660 transitions. Second operand 8 states. [2020-02-10 20:12:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:58,622 INFO L93 Difference]: Finished difference Result 363 states and 940 transitions. [2020-02-10 20:12:58,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:58,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:58,624 INFO L225 Difference]: With dead ends: 363 [2020-02-10 20:12:58,624 INFO L226 Difference]: Without dead ends: 350 [2020-02-10 20:12:58,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-02-10 20:12:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 216. [2020-02-10 20:12:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:12:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 653 transitions. [2020-02-10 20:12:58,633 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 653 transitions. Word has length 19 [2020-02-10 20:12:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:58,633 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 653 transitions. [2020-02-10 20:12:58,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 653 transitions. [2020-02-10 20:12:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:58,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:58,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:58,635 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:58,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:58,636 INFO L82 PathProgramCache]: Analyzing trace with hash 525434594, now seen corresponding path program 173 times [2020-02-10 20:12:58,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:58,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534067343] [2020-02-10 20:12:58,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:58,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534067343] [2020-02-10 20:12:58,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:58,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:58,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725708416] [2020-02-10 20:12:58,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:58,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:58,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:58,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:58,915 INFO L87 Difference]: Start difference. First operand 216 states and 653 transitions. Second operand 8 states. [2020-02-10 20:12:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:59,045 INFO L93 Difference]: Finished difference Result 364 states and 944 transitions. [2020-02-10 20:12:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:59,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:59,047 INFO L225 Difference]: With dead ends: 364 [2020-02-10 20:12:59,047 INFO L226 Difference]: Without dead ends: 350 [2020-02-10 20:12:59,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:59,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-02-10 20:12:59,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 218. [2020-02-10 20:12:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:12:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 656 transitions. [2020-02-10 20:12:59,057 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 656 transitions. Word has length 19 [2020-02-10 20:12:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:59,057 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 656 transitions. [2020-02-10 20:12:59,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 656 transitions. [2020-02-10 20:12:59,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:59,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:59,059 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:59,059 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1645564424, now seen corresponding path program 174 times [2020-02-10 20:12:59,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:59,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811350016] [2020-02-10 20:12:59,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:59,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811350016] [2020-02-10 20:12:59,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:59,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:59,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174865760] [2020-02-10 20:12:59,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:59,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:59,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:59,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:59,308 INFO L87 Difference]: Start difference. First operand 218 states and 656 transitions. Second operand 8 states. [2020-02-10 20:12:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:59,373 INFO L93 Difference]: Finished difference Result 360 states and 933 transitions. [2020-02-10 20:12:59,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:59,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:59,375 INFO L225 Difference]: With dead ends: 360 [2020-02-10 20:12:59,375 INFO L226 Difference]: Without dead ends: 344 [2020-02-10 20:12:59,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-02-10 20:12:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 212. [2020-02-10 20:12:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:12:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 644 transitions. [2020-02-10 20:12:59,380 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 644 transitions. Word has length 19 [2020-02-10 20:12:59,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:59,380 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 644 transitions. [2020-02-10 20:12:59,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 644 transitions. [2020-02-10 20:12:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:59,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:59,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:59,381 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:59,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:59,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1945413138, now seen corresponding path program 175 times [2020-02-10 20:12:59,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:59,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463828728] [2020-02-10 20:12:59,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:59,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463828728] [2020-02-10 20:12:59,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:59,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:59,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213722539] [2020-02-10 20:12:59,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:59,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:59,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:59,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:59,592 INFO L87 Difference]: Start difference. First operand 212 states and 644 transitions. Second operand 8 states. [2020-02-10 20:12:59,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:59,656 INFO L93 Difference]: Finished difference Result 380 states and 985 transitions. [2020-02-10 20:12:59,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:59,656 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:59,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:59,657 INFO L225 Difference]: With dead ends: 380 [2020-02-10 20:12:59,657 INFO L226 Difference]: Without dead ends: 364 [2020-02-10 20:12:59,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:59,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-02-10 20:12:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 226. [2020-02-10 20:12:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-02-10 20:12:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 679 transitions. [2020-02-10 20:12:59,663 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 679 transitions. Word has length 19 [2020-02-10 20:12:59,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:59,663 INFO L479 AbstractCegarLoop]: Abstraction has 226 states and 679 transitions. [2020-02-10 20:12:59,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 679 transitions. [2020-02-10 20:12:59,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:59,664 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:59,664 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:59,664 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:59,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1974902972, now seen corresponding path program 176 times [2020-02-10 20:12:59,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:59,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172684131] [2020-02-10 20:12:59,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:59,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172684131] [2020-02-10 20:12:59,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:59,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:12:59,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284492112] [2020-02-10 20:12:59,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:12:59,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:59,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:12:59,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:59,867 INFO L87 Difference]: Start difference. First operand 226 states and 679 transitions. Second operand 8 states. [2020-02-10 20:12:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:59,956 INFO L93 Difference]: Finished difference Result 378 states and 975 transitions. [2020-02-10 20:12:59,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:12:59,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:12:59,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:59,958 INFO L225 Difference]: With dead ends: 378 [2020-02-10 20:12:59,958 INFO L226 Difference]: Without dead ends: 356 [2020-02-10 20:12:59,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:12:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-02-10 20:12:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 218. [2020-02-10 20:12:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:12:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 659 transitions. [2020-02-10 20:12:59,964 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 659 transitions. Word has length 19 [2020-02-10 20:12:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:59,964 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 659 transitions. [2020-02-10 20:12:59,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:12:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 659 transitions. [2020-02-10 20:12:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:12:59,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:59,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:59,965 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:59,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:59,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1493760628, now seen corresponding path program 177 times [2020-02-10 20:12:59,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:59,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511346936] [2020-02-10 20:12:59,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:00,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:13:00,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511346936] [2020-02-10 20:13:00,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:00,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:00,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706848072] [2020-02-10 20:13:00,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:00,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:00,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:00,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:00,182 INFO L87 Difference]: Start difference. First operand 218 states and 659 transitions. Second operand 8 states. [2020-02-10 20:13:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:00,251 INFO L93 Difference]: Finished difference Result 375 states and 968 transitions. [2020-02-10 20:13:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:00,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:00,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:00,252 INFO L225 Difference]: With dead ends: 375 [2020-02-10 20:13:00,253 INFO L226 Difference]: Without dead ends: 359 [2020-02-10 20:13:00,253 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-02-10 20:13:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 223. [2020-02-10 20:13:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-02-10 20:13:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 668 transitions. [2020-02-10 20:13:00,258 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 668 transitions. Word has length 19 [2020-02-10 20:13:00,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:00,259 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 668 transitions. [2020-02-10 20:13:00,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 668 transitions. [2020-02-10 20:13:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:00,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:00,259 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:00,259 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:00,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:00,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2050144574, now seen corresponding path program 178 times [2020-02-10 20:13:00,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:00,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578827841] [2020-02-10 20:13:00,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:00,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578827841] [2020-02-10 20:13:00,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:00,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:00,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231368772] [2020-02-10 20:13:00,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:00,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:00,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:00,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:00,458 INFO L87 Difference]: Start difference. First operand 223 states and 668 transitions. Second operand 8 states. [2020-02-10 20:13:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:00,542 INFO L93 Difference]: Finished difference Result 371 states and 956 transitions. [2020-02-10 20:13:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:00,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:00,543 INFO L225 Difference]: With dead ends: 371 [2020-02-10 20:13:00,543 INFO L226 Difference]: Without dead ends: 354 [2020-02-10 20:13:00,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-02-10 20:13:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 218. [2020-02-10 20:13:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:13:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-02-10 20:13:00,548 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-02-10 20:13:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:00,548 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-02-10 20:13:00,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:00,548 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-02-10 20:13:00,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:00,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:00,549 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:00,549 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:00,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:00,549 INFO L82 PathProgramCache]: Analyzing trace with hash 780024098, now seen corresponding path program 179 times [2020-02-10 20:13:00,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:00,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439150735] [2020-02-10 20:13:00,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:00,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439150735] [2020-02-10 20:13:00,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:00,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:00,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121023624] [2020-02-10 20:13:00,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:00,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:00,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:00,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:00,740 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-02-10 20:13:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:00,831 INFO L93 Difference]: Finished difference Result 370 states and 955 transitions. [2020-02-10 20:13:00,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:00,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:00,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:00,832 INFO L225 Difference]: With dead ends: 370 [2020-02-10 20:13:00,832 INFO L226 Difference]: Without dead ends: 356 [2020-02-10 20:13:00,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-02-10 20:13:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 222. [2020-02-10 20:13:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-02-10 20:13:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 662 transitions. [2020-02-10 20:13:00,839 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 662 transitions. Word has length 19 [2020-02-10 20:13:00,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:00,839 INFO L479 AbstractCegarLoop]: Abstraction has 222 states and 662 transitions. [2020-02-10 20:13:00,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 662 transitions. [2020-02-10 20:13:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:00,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:00,845 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:00,845 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:00,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:00,845 INFO L82 PathProgramCache]: Analyzing trace with hash 779429452, now seen corresponding path program 180 times [2020-02-10 20:13:00,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:00,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801068975] [2020-02-10 20:13:00,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:01,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801068975] [2020-02-10 20:13:01,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:01,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:01,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842920881] [2020-02-10 20:13:01,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:01,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:01,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:01,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:01,036 INFO L87 Difference]: Start difference. First operand 222 states and 662 transitions. Second operand 8 states. [2020-02-10 20:13:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:01,132 INFO L93 Difference]: Finished difference Result 368 states and 947 transitions. [2020-02-10 20:13:01,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:01,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:01,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:01,134 INFO L225 Difference]: With dead ends: 368 [2020-02-10 20:13:01,134 INFO L226 Difference]: Without dead ends: 346 [2020-02-10 20:13:01,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-02-10 20:13:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 212. [2020-02-10 20:13:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:13:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 640 transitions. [2020-02-10 20:13:01,140 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 640 transitions. Word has length 19 [2020-02-10 20:13:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:01,140 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 640 transitions. [2020-02-10 20:13:01,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 640 transitions. [2020-02-10 20:13:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:01,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:01,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:01,141 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:01,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:01,141 INFO L82 PathProgramCache]: Analyzing trace with hash -637075472, now seen corresponding path program 181 times [2020-02-10 20:13:01,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:01,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838582145] [2020-02-10 20:13:01,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:01,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838582145] [2020-02-10 20:13:01,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:01,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:01,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387596064] [2020-02-10 20:13:01,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:01,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:01,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:01,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:01,333 INFO L87 Difference]: Start difference. First operand 212 states and 640 transitions. Second operand 8 states. [2020-02-10 20:13:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:01,407 INFO L93 Difference]: Finished difference Result 357 states and 917 transitions. [2020-02-10 20:13:01,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:01,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:01,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:01,408 INFO L225 Difference]: With dead ends: 357 [2020-02-10 20:13:01,408 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 20:13:01,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 20:13:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 218. [2020-02-10 20:13:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:13:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-02-10 20:13:01,413 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-02-10 20:13:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:01,413 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-02-10 20:13:01,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-02-10 20:13:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:01,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:01,414 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:01,414 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:01,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash -378017246, now seen corresponding path program 182 times [2020-02-10 20:13:01,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:01,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071816573] [2020-02-10 20:13:01,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:01,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:13:01,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071816573] [2020-02-10 20:13:01,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:01,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:01,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774006679] [2020-02-10 20:13:01,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:01,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:01,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:01,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:01,621 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-02-10 20:13:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:01,687 INFO L93 Difference]: Finished difference Result 351 states and 902 transitions. [2020-02-10 20:13:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:01,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:01,689 INFO L225 Difference]: With dead ends: 351 [2020-02-10 20:13:01,689 INFO L226 Difference]: Without dead ends: 338 [2020-02-10 20:13:01,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-02-10 20:13:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 215. [2020-02-10 20:13:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:13:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 647 transitions. [2020-02-10 20:13:01,694 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 647 transitions. Word has length 19 [2020-02-10 20:13:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:01,694 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 647 transitions. [2020-02-10 20:13:01,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 647 transitions. [2020-02-10 20:13:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:01,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:01,695 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:01,695 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2057453970, now seen corresponding path program 183 times [2020-02-10 20:13:01,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:01,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603588342] [2020-02-10 20:13:01,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:01,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603588342] [2020-02-10 20:13:01,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:01,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:01,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955123038] [2020-02-10 20:13:01,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:01,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:01,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:01,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:01,893 INFO L87 Difference]: Start difference. First operand 215 states and 647 transitions. Second operand 8 states. [2020-02-10 20:13:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:01,964 INFO L93 Difference]: Finished difference Result 356 states and 912 transitions. [2020-02-10 20:13:01,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:01,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:01,965 INFO L225 Difference]: With dead ends: 356 [2020-02-10 20:13:01,965 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 20:13:01,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 20:13:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 220. [2020-02-10 20:13:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 20:13:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 656 transitions. [2020-02-10 20:13:01,970 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 656 transitions. Word has length 19 [2020-02-10 20:13:01,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:01,970 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 656 transitions. [2020-02-10 20:13:01,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 656 transitions. [2020-02-10 20:13:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:01,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:01,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:01,971 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:01,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:01,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1306391876, now seen corresponding path program 184 times [2020-02-10 20:13:01,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:01,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672976349] [2020-02-10 20:13:01,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:02,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672976349] [2020-02-10 20:13:02,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:02,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:02,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813099519] [2020-02-10 20:13:02,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:02,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:02,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:02,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:02,167 INFO L87 Difference]: Start difference. First operand 220 states and 656 transitions. Second operand 8 states. [2020-02-10 20:13:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:02,262 INFO L93 Difference]: Finished difference Result 352 states and 900 transitions. [2020-02-10 20:13:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:02,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:02,263 INFO L225 Difference]: With dead ends: 352 [2020-02-10 20:13:02,263 INFO L226 Difference]: Without dead ends: 335 [2020-02-10 20:13:02,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-02-10 20:13:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2020-02-10 20:13:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:13:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 644 transitions. [2020-02-10 20:13:02,268 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 644 transitions. Word has length 19 [2020-02-10 20:13:02,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:02,268 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 644 transitions. [2020-02-10 20:13:02,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 644 transitions. [2020-02-10 20:13:02,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:02,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:02,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:02,269 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:02,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:02,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1837091698, now seen corresponding path program 185 times [2020-02-10 20:13:02,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:02,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758429384] [2020-02-10 20:13:02,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:02,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758429384] [2020-02-10 20:13:02,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:02,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:02,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91893430] [2020-02-10 20:13:02,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:02,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:02,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:02,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:02,494 INFO L87 Difference]: Start difference. First operand 215 states and 644 transitions. Second operand 8 states. [2020-02-10 20:13:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:02,558 INFO L93 Difference]: Finished difference Result 341 states and 876 transitions. [2020-02-10 20:13:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:02,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:02,559 INFO L225 Difference]: With dead ends: 341 [2020-02-10 20:13:02,560 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 20:13:02,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 20:13:02,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 217. [2020-02-10 20:13:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:13:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 647 transitions. [2020-02-10 20:13:02,565 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 647 transitions. Word has length 19 [2020-02-10 20:13:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:02,565 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 647 transitions. [2020-02-10 20:13:02,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 647 transitions. [2020-02-10 20:13:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:02,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:02,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:02,566 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:02,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:02,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1602568944, now seen corresponding path program 186 times [2020-02-10 20:13:02,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:02,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668772778] [2020-02-10 20:13:02,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:02,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668772778] [2020-02-10 20:13:02,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:02,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:02,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146918800] [2020-02-10 20:13:02,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:02,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:02,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:02,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:02,762 INFO L87 Difference]: Start difference. First operand 217 states and 647 transitions. Second operand 8 states. [2020-02-10 20:13:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:02,869 INFO L93 Difference]: Finished difference Result 339 states and 871 transitions. [2020-02-10 20:13:02,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:02,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:02,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:02,871 INFO L225 Difference]: With dead ends: 339 [2020-02-10 20:13:02,871 INFO L226 Difference]: Without dead ends: 322 [2020-02-10 20:13:02,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-02-10 20:13:02,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 212. [2020-02-10 20:13:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:13:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-02-10 20:13:02,877 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-02-10 20:13:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:02,877 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-02-10 20:13:02,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:02,877 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-02-10 20:13:02,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:02,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:02,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:02,878 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:02,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:02,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2036640602, now seen corresponding path program 187 times [2020-02-10 20:13:02,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:02,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238325161] [2020-02-10 20:13:02,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:03,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238325161] [2020-02-10 20:13:03,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:03,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:03,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396356202] [2020-02-10 20:13:03,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:03,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:03,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:03,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:03,071 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-02-10 20:13:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:03,157 INFO L93 Difference]: Finished difference Result 347 states and 896 transitions. [2020-02-10 20:13:03,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:03,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:03,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:03,158 INFO L225 Difference]: With dead ends: 347 [2020-02-10 20:13:03,158 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 20:13:03,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:03,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 20:13:03,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 216. [2020-02-10 20:13:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:13:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 647 transitions. [2020-02-10 20:13:03,163 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 647 transitions. Word has length 19 [2020-02-10 20:13:03,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:03,163 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 647 transitions. [2020-02-10 20:13:03,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:03,163 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 647 transitions. [2020-02-10 20:13:03,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:03,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:03,163 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:03,165 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:03,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:03,165 INFO L82 PathProgramCache]: Analyzing trace with hash -916510772, now seen corresponding path program 188 times [2020-02-10 20:13:03,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:03,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142104046] [2020-02-10 20:13:03,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:03,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142104046] [2020-02-10 20:13:03,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:03,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:03,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138764075] [2020-02-10 20:13:03,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:03,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:03,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:03,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:03,391 INFO L87 Difference]: Start difference. First operand 216 states and 647 transitions. Second operand 8 states. [2020-02-10 20:13:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:03,466 INFO L93 Difference]: Finished difference Result 343 states and 885 transitions. [2020-02-10 20:13:03,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:03,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:03,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:03,467 INFO L225 Difference]: With dead ends: 343 [2020-02-10 20:13:03,467 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 20:13:03,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 20:13:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 214. [2020-02-10 20:13:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-02-10 20:13:03,479 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-02-10 20:13:03,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:03,480 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-02-10 20:13:03,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:03,480 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-02-10 20:13:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:03,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:03,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:03,482 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:03,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:03,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1513624196, now seen corresponding path program 189 times [2020-02-10 20:13:03,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:03,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589648717] [2020-02-10 20:13:03,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:03,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589648717] [2020-02-10 20:13:03,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:03,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:03,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007846343] [2020-02-10 20:13:03,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:03,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:03,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:03,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:03,705 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-02-10 20:13:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:03,796 INFO L93 Difference]: Finished difference Result 347 states and 894 transitions. [2020-02-10 20:13:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:03,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:03,797 INFO L225 Difference]: With dead ends: 347 [2020-02-10 20:13:03,797 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 20:13:03,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 20:13:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 218. [2020-02-10 20:13:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:13:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 650 transitions. [2020-02-10 20:13:03,812 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 650 transitions. Word has length 19 [2020-02-10 20:13:03,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:03,812 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 650 transitions. [2020-02-10 20:13:03,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:03,812 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 650 transitions. [2020-02-10 20:13:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:03,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:03,813 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:03,813 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:03,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:03,814 INFO L82 PathProgramCache]: Analyzing trace with hash 768327052, now seen corresponding path program 190 times [2020-02-10 20:13:03,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:03,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905110026] [2020-02-10 20:13:03,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:03,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905110026] [2020-02-10 20:13:03,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:03,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:03,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482206135] [2020-02-10 20:13:04,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:04,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:04,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:04,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:04,000 INFO L87 Difference]: Start difference. First operand 218 states and 650 transitions. Second operand 8 states. [2020-02-10 20:13:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:04,085 INFO L93 Difference]: Finished difference Result 345 states and 886 transitions. [2020-02-10 20:13:04,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:04,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:04,086 INFO L225 Difference]: With dead ends: 345 [2020-02-10 20:13:04,086 INFO L226 Difference]: Without dead ends: 329 [2020-02-10 20:13:04,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-02-10 20:13:04,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 214. [2020-02-10 20:13:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 640 transitions. [2020-02-10 20:13:04,092 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 640 transitions. Word has length 19 [2020-02-10 20:13:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:04,092 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 640 transitions. [2020-02-10 20:13:04,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 640 transitions. [2020-02-10 20:13:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:04,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:04,093 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:04,093 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:04,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:04,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1451740574, now seen corresponding path program 191 times [2020-02-10 20:13:04,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:04,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812263572] [2020-02-10 20:13:04,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:04,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812263572] [2020-02-10 20:13:04,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:04,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:04,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404021698] [2020-02-10 20:13:04,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:04,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:04,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:04,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:04,308 INFO L87 Difference]: Start difference. First operand 214 states and 640 transitions. Second operand 8 states. [2020-02-10 20:13:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:04,369 INFO L93 Difference]: Finished difference Result 337 states and 867 transitions. [2020-02-10 20:13:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:04,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:04,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:04,370 INFO L225 Difference]: With dead ends: 337 [2020-02-10 20:13:04,370 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 20:13:04,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:04,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 20:13:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 216. [2020-02-10 20:13:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:13:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 643 transitions. [2020-02-10 20:13:04,377 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 643 transitions. Word has length 19 [2020-02-10 20:13:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:04,378 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 643 transitions. [2020-02-10 20:13:04,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 643 transitions. [2020-02-10 20:13:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:04,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:04,378 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:04,379 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:04,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1987920068, now seen corresponding path program 192 times [2020-02-10 20:13:04,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:04,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711661012] [2020-02-10 20:13:04,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:04,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711661012] [2020-02-10 20:13:04,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:04,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:04,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543492700] [2020-02-10 20:13:04,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:04,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:04,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:04,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:04,557 INFO L87 Difference]: Start difference. First operand 216 states and 643 transitions. Second operand 8 states. [2020-02-10 20:13:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:04,666 INFO L93 Difference]: Finished difference Result 335 states and 862 transitions. [2020-02-10 20:13:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:04,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:04,667 INFO L225 Difference]: With dead ends: 335 [2020-02-10 20:13:04,667 INFO L226 Difference]: Without dead ends: 315 [2020-02-10 20:13:04,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:04,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-02-10 20:13:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 208. [2020-02-10 20:13:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 20:13:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 628 transitions. [2020-02-10 20:13:04,675 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 628 transitions. Word has length 19 [2020-02-10 20:13:04,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:04,675 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 628 transitions. [2020-02-10 20:13:04,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 628 transitions. [2020-02-10 20:13:04,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:04,676 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:04,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:04,676 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:04,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:04,676 INFO L82 PathProgramCache]: Analyzing trace with hash 807111978, now seen corresponding path program 193 times [2020-02-10 20:13:04,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:04,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967954562] [2020-02-10 20:13:04,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:04,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:13:04,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967954562] [2020-02-10 20:13:04,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:04,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:04,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809234982] [2020-02-10 20:13:04,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:04,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:04,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:04,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:04,900 INFO L87 Difference]: Start difference. First operand 208 states and 628 transitions. Second operand 8 states. [2020-02-10 20:13:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:04,958 INFO L93 Difference]: Finished difference Result 357 states and 929 transitions. [2020-02-10 20:13:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:04,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:04,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:04,960 INFO L225 Difference]: With dead ends: 357 [2020-02-10 20:13:04,960 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 20:13:04,960 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 20:13:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 217. [2020-02-10 20:13:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:13:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 655 transitions. [2020-02-10 20:13:04,964 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 655 transitions. Word has length 19 [2020-02-10 20:13:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:04,964 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 655 transitions. [2020-02-10 20:13:04,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 655 transitions. [2020-02-10 20:13:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:04,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:04,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:04,965 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:04,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:04,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1066170204, now seen corresponding path program 194 times [2020-02-10 20:13:04,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:04,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503165134] [2020-02-10 20:13:04,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:05,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503165134] [2020-02-10 20:13:05,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:05,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:05,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504107042] [2020-02-10 20:13:05,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:05,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:05,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:05,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:05,177 INFO L87 Difference]: Start difference. First operand 217 states and 655 transitions. Second operand 8 states. [2020-02-10 20:13:05,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:05,241 INFO L93 Difference]: Finished difference Result 351 states and 914 transitions. [2020-02-10 20:13:05,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:05,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:05,242 INFO L225 Difference]: With dead ends: 351 [2020-02-10 20:13:05,242 INFO L226 Difference]: Without dead ends: 338 [2020-02-10 20:13:05,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-02-10 20:13:05,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 214. [2020-02-10 20:13:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 648 transitions. [2020-02-10 20:13:05,249 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 648 transitions. Word has length 19 [2020-02-10 20:13:05,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:05,249 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 648 transitions. [2020-02-10 20:13:05,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:05,249 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 648 transitions. [2020-02-10 20:13:05,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:05,250 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:05,250 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:05,250 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:05,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:05,250 INFO L82 PathProgramCache]: Analyzing trace with hash -793325876, now seen corresponding path program 195 times [2020-02-10 20:13:05,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:05,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289664174] [2020-02-10 20:13:05,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:05,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289664174] [2020-02-10 20:13:05,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:05,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:05,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33325821] [2020-02-10 20:13:05,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:05,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:05,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:05,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:05,457 INFO L87 Difference]: Start difference. First operand 214 states and 648 transitions. Second operand 8 states. [2020-02-10 20:13:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:05,537 INFO L93 Difference]: Finished difference Result 361 states and 938 transitions. [2020-02-10 20:13:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:05,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:05,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:05,538 INFO L225 Difference]: With dead ends: 361 [2020-02-10 20:13:05,539 INFO L226 Difference]: Without dead ends: 345 [2020-02-10 20:13:05,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-02-10 20:13:05,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 219. [2020-02-10 20:13:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 20:13:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 657 transitions. [2020-02-10 20:13:05,544 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 657 transitions. Word has length 19 [2020-02-10 20:13:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:05,545 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 657 transitions. [2020-02-10 20:13:05,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 657 transitions. [2020-02-10 20:13:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:05,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:05,545 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:05,545 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:05,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1544387970, now seen corresponding path program 196 times [2020-02-10 20:13:05,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:05,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164931525] [2020-02-10 20:13:05,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:05,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164931525] [2020-02-10 20:13:05,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:05,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:05,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944282556] [2020-02-10 20:13:05,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:05,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:05,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:05,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:05,776 INFO L87 Difference]: Start difference. First operand 219 states and 657 transitions. Second operand 8 states. [2020-02-10 20:13:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:05,863 INFO L93 Difference]: Finished difference Result 357 states and 926 transitions. [2020-02-10 20:13:05,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:05,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:05,864 INFO L225 Difference]: With dead ends: 357 [2020-02-10 20:13:05,864 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 20:13:05,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 20:13:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 214. [2020-02-10 20:13:05,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 645 transitions. [2020-02-10 20:13:05,869 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 645 transitions. Word has length 19 [2020-02-10 20:13:05,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:05,870 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 645 transitions. [2020-02-10 20:13:05,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:05,870 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 645 transitions. [2020-02-10 20:13:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:05,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:05,870 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:05,870 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:05,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:05,870 INFO L82 PathProgramCache]: Analyzing trace with hash -392904248, now seen corresponding path program 197 times [2020-02-10 20:13:05,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:05,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680130552] [2020-02-10 20:13:05,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:06,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680130552] [2020-02-10 20:13:06,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:06,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:06,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955334804] [2020-02-10 20:13:06,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:06,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:06,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:06,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:06,100 INFO L87 Difference]: Start difference. First operand 214 states and 645 transitions. Second operand 8 states. [2020-02-10 20:13:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:06,171 INFO L93 Difference]: Finished difference Result 346 states and 902 transitions. [2020-02-10 20:13:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:06,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:06,173 INFO L225 Difference]: With dead ends: 346 [2020-02-10 20:13:06,173 INFO L226 Difference]: Without dead ends: 336 [2020-02-10 20:13:06,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-02-10 20:13:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 216. [2020-02-10 20:13:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:13:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 648 transitions. [2020-02-10 20:13:06,178 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 648 transitions. Word has length 19 [2020-02-10 20:13:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:06,178 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 648 transitions. [2020-02-10 20:13:06,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:06,178 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 648 transitions. [2020-02-10 20:13:06,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:06,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:06,179 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:06,179 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:06,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:06,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1248210902, now seen corresponding path program 198 times [2020-02-10 20:13:06,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:06,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129405271] [2020-02-10 20:13:06,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:06,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129405271] [2020-02-10 20:13:06,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:06,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:06,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764267812] [2020-02-10 20:13:06,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:06,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:06,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:06,376 INFO L87 Difference]: Start difference. First operand 216 states and 648 transitions. Second operand 8 states. [2020-02-10 20:13:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:06,467 INFO L93 Difference]: Finished difference Result 348 states and 905 transitions. [2020-02-10 20:13:06,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:06,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:06,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:06,469 INFO L225 Difference]: With dead ends: 348 [2020-02-10 20:13:06,469 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 20:13:06,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 20:13:06,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 211. [2020-02-10 20:13:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 20:13:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 638 transitions. [2020-02-10 20:13:06,475 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 638 transitions. Word has length 19 [2020-02-10 20:13:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:06,475 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 638 transitions. [2020-02-10 20:13:06,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:06,475 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 638 transitions. [2020-02-10 20:13:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:06,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:06,476 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:06,476 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:06,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1561821240, now seen corresponding path program 199 times [2020-02-10 20:13:06,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:06,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011805777] [2020-02-10 20:13:06,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:06,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011805777] [2020-02-10 20:13:06,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:06,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:06,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610754387] [2020-02-10 20:13:06,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:06,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:06,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:06,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:06,687 INFO L87 Difference]: Start difference. First operand 211 states and 638 transitions. Second operand 8 states. [2020-02-10 20:13:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:06,747 INFO L93 Difference]: Finished difference Result 359 states and 931 transitions. [2020-02-10 20:13:06,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:06,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:06,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:06,748 INFO L225 Difference]: With dead ends: 359 [2020-02-10 20:13:06,748 INFO L226 Difference]: Without dead ends: 343 [2020-02-10 20:13:06,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-02-10 20:13:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 217. [2020-02-10 20:13:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:13:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 652 transitions. [2020-02-10 20:13:06,755 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 652 transitions. Word has length 19 [2020-02-10 20:13:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:06,755 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 652 transitions. [2020-02-10 20:13:06,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 652 transitions. [2020-02-10 20:13:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:06,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:06,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:06,756 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:06,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:06,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1302763014, now seen corresponding path program 200 times [2020-02-10 20:13:06,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:06,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322666909] [2020-02-10 20:13:06,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:06,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322666909] [2020-02-10 20:13:06,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:06,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:06,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474526202] [2020-02-10 20:13:06,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:06,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:06,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:06,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:06,979 INFO L87 Difference]: Start difference. First operand 217 states and 652 transitions. Second operand 8 states. [2020-02-10 20:13:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:07,036 INFO L93 Difference]: Finished difference Result 353 states and 916 transitions. [2020-02-10 20:13:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:07,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:07,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:07,037 INFO L225 Difference]: With dead ends: 353 [2020-02-10 20:13:07,038 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 20:13:07,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 20:13:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 214. [2020-02-10 20:13:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 645 transitions. [2020-02-10 20:13:07,043 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 645 transitions. Word has length 19 [2020-02-10 20:13:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:07,043 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 645 transitions. [2020-02-10 20:13:07,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 645 transitions. [2020-02-10 20:13:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:07,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:07,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:07,044 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:07,045 INFO L82 PathProgramCache]: Analyzing trace with hash -467729652, now seen corresponding path program 201 times [2020-02-10 20:13:07,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:07,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51975445] [2020-02-10 20:13:07,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:07,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51975445] [2020-02-10 20:13:07,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:07,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:07,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935508204] [2020-02-10 20:13:07,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:07,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:07,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:07,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:07,244 INFO L87 Difference]: Start difference. First operand 214 states and 645 transitions. Second operand 8 states. [2020-02-10 20:13:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:07,308 INFO L93 Difference]: Finished difference Result 365 states and 945 transitions. [2020-02-10 20:13:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:07,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:07,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:07,310 INFO L225 Difference]: With dead ends: 365 [2020-02-10 20:13:07,310 INFO L226 Difference]: Without dead ends: 349 [2020-02-10 20:13:07,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-02-10 20:13:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 220. [2020-02-10 20:13:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 20:13:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 656 transitions. [2020-02-10 20:13:07,315 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 656 transitions. Word has length 19 [2020-02-10 20:13:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:07,315 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 656 transitions. [2020-02-10 20:13:07,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:07,315 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 656 transitions. [2020-02-10 20:13:07,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:07,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:07,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:07,316 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:07,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1443934402, now seen corresponding path program 202 times [2020-02-10 20:13:07,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:07,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578138029] [2020-02-10 20:13:07,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:07,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578138029] [2020-02-10 20:13:07,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:07,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:07,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326569052] [2020-02-10 20:13:07,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:07,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:07,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:07,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:07,527 INFO L87 Difference]: Start difference. First operand 220 states and 656 transitions. Second operand 8 states. [2020-02-10 20:13:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:07,616 INFO L93 Difference]: Finished difference Result 362 states and 934 transitions. [2020-02-10 20:13:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:07,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:07,617 INFO L225 Difference]: With dead ends: 362 [2020-02-10 20:13:07,618 INFO L226 Difference]: Without dead ends: 343 [2020-02-10 20:13:07,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:07,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-02-10 20:13:07,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 214. [2020-02-10 20:13:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-02-10 20:13:07,623 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-02-10 20:13:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:07,623 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-02-10 20:13:07,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-02-10 20:13:07,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:07,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:07,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:07,624 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:07,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:07,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1543632934, now seen corresponding path program 203 times [2020-02-10 20:13:07,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:07,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012950369] [2020-02-10 20:13:07,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:07,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012950369] [2020-02-10 20:13:07,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:07,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:07,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342867736] [2020-02-10 20:13:07,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:07,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:07,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:07,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:07,819 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-02-10 20:13:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:07,887 INFO L93 Difference]: Finished difference Result 349 states and 906 transitions. [2020-02-10 20:13:07,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:07,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:07,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:07,888 INFO L225 Difference]: With dead ends: 349 [2020-02-10 20:13:07,888 INFO L226 Difference]: Without dead ends: 339 [2020-02-10 20:13:07,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:07,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-02-10 20:13:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 216. [2020-02-10 20:13:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:13:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 645 transitions. [2020-02-10 20:13:07,893 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 645 transitions. Word has length 19 [2020-02-10 20:13:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:07,893 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 645 transitions. [2020-02-10 20:13:07,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 645 transitions. [2020-02-10 20:13:07,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:07,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:07,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:07,894 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:07,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:07,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1261929366, now seen corresponding path program 204 times [2020-02-10 20:13:07,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:07,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492192590] [2020-02-10 20:13:07,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:08,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492192590] [2020-02-10 20:13:08,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:08,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:08,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109553329] [2020-02-10 20:13:08,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:08,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:08,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:08,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:08,098 INFO L87 Difference]: Start difference. First operand 216 states and 645 transitions. Second operand 8 states. [2020-02-10 20:13:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:08,176 INFO L93 Difference]: Finished difference Result 352 states and 911 transitions. [2020-02-10 20:13:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:08,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:08,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:08,178 INFO L225 Difference]: With dead ends: 352 [2020-02-10 20:13:08,178 INFO L226 Difference]: Without dead ends: 334 [2020-02-10 20:13:08,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-02-10 20:13:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 211. [2020-02-10 20:13:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 20:13:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 635 transitions. [2020-02-10 20:13:08,183 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 635 transitions. Word has length 19 [2020-02-10 20:13:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:08,183 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 635 transitions. [2020-02-10 20:13:08,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 635 transitions. [2020-02-10 20:13:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:08,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:08,184 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:08,184 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:08,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:08,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1236225016, now seen corresponding path program 205 times [2020-02-10 20:13:08,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:08,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883567047] [2020-02-10 20:13:08,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:08,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883567047] [2020-02-10 20:13:08,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:08,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:08,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756382636] [2020-02-10 20:13:08,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:08,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:08,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:08,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:08,393 INFO L87 Difference]: Start difference. First operand 211 states and 635 transitions. Second operand 8 states. [2020-02-10 20:13:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:08,453 INFO L93 Difference]: Finished difference Result 366 states and 949 transitions. [2020-02-10 20:13:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:08,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:08,455 INFO L225 Difference]: With dead ends: 366 [2020-02-10 20:13:08,455 INFO L226 Difference]: Without dead ends: 350 [2020-02-10 20:13:08,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-02-10 20:13:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 221. [2020-02-10 20:13:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-02-10 20:13:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 663 transitions. [2020-02-10 20:13:08,460 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 663 transitions. Word has length 19 [2020-02-10 20:13:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:08,460 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 663 transitions. [2020-02-10 20:13:08,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 663 transitions. [2020-02-10 20:13:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:08,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:08,460 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:08,461 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:08,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:08,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1987287110, now seen corresponding path program 206 times [2020-02-10 20:13:08,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:08,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889608294] [2020-02-10 20:13:08,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:08,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889608294] [2020-02-10 20:13:08,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:08,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:08,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279707110] [2020-02-10 20:13:08,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:08,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:08,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:08,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:08,669 INFO L87 Difference]: Start difference. First operand 221 states and 663 transitions. Second operand 8 states. [2020-02-10 20:13:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:08,748 INFO L93 Difference]: Finished difference Result 362 states and 937 transitions. [2020-02-10 20:13:08,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:08,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:08,750 INFO L225 Difference]: With dead ends: 362 [2020-02-10 20:13:08,750 INFO L226 Difference]: Without dead ends: 345 [2020-02-10 20:13:08,750 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-02-10 20:13:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 216. [2020-02-10 20:13:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:13:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 649 transitions. [2020-02-10 20:13:08,756 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 649 transitions. Word has length 19 [2020-02-10 20:13:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:08,756 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 649 transitions. [2020-02-10 20:13:08,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 649 transitions. [2020-02-10 20:13:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:08,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:08,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:08,757 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:08,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:08,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1458304426, now seen corresponding path program 207 times [2020-02-10 20:13:08,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:08,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880920051] [2020-02-10 20:13:08,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:08,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880920051] [2020-02-10 20:13:08,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:08,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:08,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142525615] [2020-02-10 20:13:08,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:08,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:08,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:08,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:08,973 INFO L87 Difference]: Start difference. First operand 216 states and 649 transitions. Second operand 8 states. [2020-02-10 20:13:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:09,036 INFO L93 Difference]: Finished difference Result 368 states and 949 transitions. [2020-02-10 20:13:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:09,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:09,037 INFO L225 Difference]: With dead ends: 368 [2020-02-10 20:13:09,037 INFO L226 Difference]: Without dead ends: 352 [2020-02-10 20:13:09,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2020-02-10 20:13:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 222. [2020-02-10 20:13:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-02-10 20:13:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 660 transitions. [2020-02-10 20:13:09,042 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 660 transitions. Word has length 19 [2020-02-10 20:13:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:09,042 INFO L479 AbstractCegarLoop]: Abstraction has 222 states and 660 transitions. [2020-02-10 20:13:09,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 660 transitions. [2020-02-10 20:13:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:09,042 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:09,042 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:09,042 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:09,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:09,043 INFO L82 PathProgramCache]: Analyzing trace with hash 482099676, now seen corresponding path program 208 times [2020-02-10 20:13:09,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:09,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26504468] [2020-02-10 20:13:09,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:09,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:13:09,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26504468] [2020-02-10 20:13:09,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:09,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:09,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021072291] [2020-02-10 20:13:09,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:09,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:09,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:09,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:09,251 INFO L87 Difference]: Start difference. First operand 222 states and 660 transitions. Second operand 8 states. [2020-02-10 20:13:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:09,333 INFO L93 Difference]: Finished difference Result 365 states and 938 transitions. [2020-02-10 20:13:09,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:09,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:09,335 INFO L225 Difference]: With dead ends: 365 [2020-02-10 20:13:09,335 INFO L226 Difference]: Without dead ends: 346 [2020-02-10 20:13:09,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-02-10 20:13:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 216. [2020-02-10 20:13:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:13:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 644 transitions. [2020-02-10 20:13:09,341 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 644 transitions. Word has length 19 [2020-02-10 20:13:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:09,341 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 644 transitions. [2020-02-10 20:13:09,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 644 transitions. [2020-02-10 20:13:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:09,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:09,341 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:09,341 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:09,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2110104008, now seen corresponding path program 209 times [2020-02-10 20:13:09,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:09,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369286607] [2020-02-10 20:13:09,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:09,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:09,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369286607] [2020-02-10 20:13:09,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:09,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:09,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211415833] [2020-02-10 20:13:09,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:09,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:09,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:09,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:09,546 INFO L87 Difference]: Start difference. First operand 216 states and 644 transitions. Second operand 8 states. [2020-02-10 20:13:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:09,630 INFO L93 Difference]: Finished difference Result 358 states and 925 transitions. [2020-02-10 20:13:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:09,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:09,631 INFO L225 Difference]: With dead ends: 358 [2020-02-10 20:13:09,631 INFO L226 Difference]: Without dead ends: 346 [2020-02-10 20:13:09,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-02-10 20:13:09,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 220. [2020-02-10 20:13:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 20:13:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 652 transitions. [2020-02-10 20:13:09,637 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 652 transitions. Word has length 19 [2020-02-10 20:13:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:09,637 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 652 transitions. [2020-02-10 20:13:09,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 652 transitions. [2020-02-10 20:13:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:09,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:09,638 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:09,638 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:09,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:09,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1325988758, now seen corresponding path program 210 times [2020-02-10 20:13:09,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:09,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140075212] [2020-02-10 20:13:09,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:09,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140075212] [2020-02-10 20:13:09,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:09,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:09,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028608821] [2020-02-10 20:13:09,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:09,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:09,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:09,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:09,846 INFO L87 Difference]: Start difference. First operand 220 states and 652 transitions. Second operand 8 states. [2020-02-10 20:13:09,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:09,934 INFO L93 Difference]: Finished difference Result 359 states and 923 transitions. [2020-02-10 20:13:09,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:09,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:09,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:09,936 INFO L225 Difference]: With dead ends: 359 [2020-02-10 20:13:09,936 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 20:13:09,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 20:13:09,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 211. [2020-02-10 20:13:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 20:13:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 632 transitions. [2020-02-10 20:13:09,941 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 632 transitions. Word has length 19 [2020-02-10 20:13:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:09,941 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 632 transitions. [2020-02-10 20:13:09,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 632 transitions. [2020-02-10 20:13:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:09,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:09,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:09,942 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1946024220, now seen corresponding path program 211 times [2020-02-10 20:13:09,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:09,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906824303] [2020-02-10 20:13:09,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:10,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906824303] [2020-02-10 20:13:10,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:10,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:10,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650416636] [2020-02-10 20:13:10,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:10,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:10,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:10,155 INFO L87 Difference]: Start difference. First operand 211 states and 632 transitions. Second operand 8 states. [2020-02-10 20:13:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:10,227 INFO L93 Difference]: Finished difference Result 335 states and 868 transitions. [2020-02-10 20:13:10,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:10,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:10,229 INFO L225 Difference]: With dead ends: 335 [2020-02-10 20:13:10,229 INFO L226 Difference]: Without dead ends: 325 [2020-02-10 20:13:10,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-02-10 20:13:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 215. [2020-02-10 20:13:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:13:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 642 transitions. [2020-02-10 20:13:10,234 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 642 transitions. Word has length 19 [2020-02-10 20:13:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:10,235 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 642 transitions. [2020-02-10 20:13:10,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 642 transitions. [2020-02-10 20:13:10,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:10,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:10,235 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:10,235 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:10,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:10,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1090717566, now seen corresponding path program 212 times [2020-02-10 20:13:10,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:10,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926722181] [2020-02-10 20:13:10,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:10,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926722181] [2020-02-10 20:13:10,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:10,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:10,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33984316] [2020-02-10 20:13:10,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:10,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:10,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:10,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:10,440 INFO L87 Difference]: Start difference. First operand 215 states and 642 transitions. Second operand 8 states. [2020-02-10 20:13:10,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:10,533 INFO L93 Difference]: Finished difference Result 337 states and 871 transitions. [2020-02-10 20:13:10,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:10,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:10,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:10,534 INFO L225 Difference]: With dead ends: 337 [2020-02-10 20:13:10,534 INFO L226 Difference]: Without dead ends: 323 [2020-02-10 20:13:10,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-02-10 20:13:10,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 213. [2020-02-10 20:13:10,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-02-10 20:13:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 637 transitions. [2020-02-10 20:13:10,539 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 637 transitions. Word has length 19 [2020-02-10 20:13:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:10,539 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 637 transitions. [2020-02-10 20:13:10,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 637 transitions. [2020-02-10 20:13:10,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:10,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:10,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:10,540 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:10,540 INFO L82 PathProgramCache]: Analyzing trace with hash -738002118, now seen corresponding path program 213 times [2020-02-10 20:13:10,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:10,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626838011] [2020-02-10 20:13:10,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:10,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626838011] [2020-02-10 20:13:10,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:10,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:10,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230908776] [2020-02-10 20:13:10,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:10,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:10,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:10,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:10,747 INFO L87 Difference]: Start difference. First operand 213 states and 637 transitions. Second operand 8 states. [2020-02-10 20:13:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:10,814 INFO L93 Difference]: Finished difference Result 336 states and 868 transitions. [2020-02-10 20:13:10,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:10,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:10,815 INFO L225 Difference]: With dead ends: 336 [2020-02-10 20:13:10,815 INFO L226 Difference]: Without dead ends: 326 [2020-02-10 20:13:10,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-02-10 20:13:10,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 215. [2020-02-10 20:13:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:13:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 640 transitions. [2020-02-10 20:13:10,820 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 640 transitions. Word has length 19 [2020-02-10 20:13:10,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:10,820 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 640 transitions. [2020-02-10 20:13:10,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 640 transitions. [2020-02-10 20:13:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:10,821 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:10,821 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:10,821 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:10,822 INFO L82 PathProgramCache]: Analyzing trace with hash 751402878, now seen corresponding path program 214 times [2020-02-10 20:13:10,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:10,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321233471] [2020-02-10 20:13:10,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:11,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321233471] [2020-02-10 20:13:11,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:11,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:11,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549976494] [2020-02-10 20:13:11,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:11,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:11,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:11,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:11,023 INFO L87 Difference]: Start difference. First operand 215 states and 640 transitions. Second operand 8 states. [2020-02-10 20:13:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:11,112 INFO L93 Difference]: Finished difference Result 339 states and 873 transitions. [2020-02-10 20:13:11,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:11,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:11,113 INFO L225 Difference]: With dead ends: 339 [2020-02-10 20:13:11,113 INFO L226 Difference]: Without dead ends: 324 [2020-02-10 20:13:11,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-02-10 20:13:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 213. [2020-02-10 20:13:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-02-10 20:13:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 635 transitions. [2020-02-10 20:13:11,119 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 635 transitions. Word has length 19 [2020-02-10 20:13:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:11,119 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 635 transitions. [2020-02-10 20:13:11,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 635 transitions. [2020-02-10 20:13:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:11,120 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:11,120 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:11,120 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash 17632186, now seen corresponding path program 215 times [2020-02-10 20:13:11,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:11,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16557764] [2020-02-10 20:13:11,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:11,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16557764] [2020-02-10 20:13:11,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:11,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:11,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796496363] [2020-02-10 20:13:11,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:11,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:11,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:11,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:11,380 INFO L87 Difference]: Start difference. First operand 213 states and 635 transitions. Second operand 8 states. [2020-02-10 20:13:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:11,484 INFO L93 Difference]: Finished difference Result 338 states and 871 transitions. [2020-02-10 20:13:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:11,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:11,486 INFO L225 Difference]: With dead ends: 338 [2020-02-10 20:13:11,486 INFO L226 Difference]: Without dead ends: 326 [2020-02-10 20:13:11,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:11,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-02-10 20:13:11,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 217. [2020-02-10 20:13:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:13:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 643 transitions. [2020-02-10 20:13:11,494 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 643 transitions. Word has length 19 [2020-02-10 20:13:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:11,494 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 643 transitions. [2020-02-10 20:13:11,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 643 transitions. [2020-02-10 20:13:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:11,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:11,495 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:11,495 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:11,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash -738002118, now seen corresponding path program 216 times [2020-02-10 20:13:11,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:11,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981624973] [2020-02-10 20:13:11,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:11,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981624973] [2020-02-10 20:13:11,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:11,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:11,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132927592] [2020-02-10 20:13:11,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:11,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:11,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:11,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:11,737 INFO L87 Difference]: Start difference. First operand 217 states and 643 transitions. Second operand 8 states. [2020-02-10 20:13:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:11,817 INFO L93 Difference]: Finished difference Result 339 states and 869 transitions. [2020-02-10 20:13:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:11,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:11,818 INFO L225 Difference]: With dead ends: 339 [2020-02-10 20:13:11,819 INFO L226 Difference]: Without dead ends: 317 [2020-02-10 20:13:11,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-02-10 20:13:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 208. [2020-02-10 20:13:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 20:13:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 625 transitions. [2020-02-10 20:13:11,825 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 625 transitions. Word has length 19 [2020-02-10 20:13:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:11,825 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 625 transitions. [2020-02-10 20:13:11,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 625 transitions. [2020-02-10 20:13:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:11,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:11,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:11,826 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:11,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:11,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1434799680, now seen corresponding path program 217 times [2020-02-10 20:13:11,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:11,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197315255] [2020-02-10 20:13:11,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:12,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197315255] [2020-02-10 20:13:12,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:12,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:12,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191357437] [2020-02-10 20:13:12,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:12,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:12,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:12,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:12,002 INFO L87 Difference]: Start difference. First operand 208 states and 625 transitions. Second operand 8 states. [2020-02-10 20:13:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:12,076 INFO L93 Difference]: Finished difference Result 338 states and 886 transitions. [2020-02-10 20:13:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:12,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:12,078 INFO L225 Difference]: With dead ends: 338 [2020-02-10 20:13:12,078 INFO L226 Difference]: Without dead ends: 324 [2020-02-10 20:13:12,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-02-10 20:13:12,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 214. [2020-02-10 20:13:12,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 644 transitions. [2020-02-10 20:13:12,083 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 644 transitions. Word has length 19 [2020-02-10 20:13:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:12,083 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 644 transitions. [2020-02-10 20:13:12,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 644 transitions. [2020-02-10 20:13:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:12,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:12,084 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:12,084 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:12,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:12,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1740037786, now seen corresponding path program 218 times [2020-02-10 20:13:12,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:12,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993887352] [2020-02-10 20:13:12,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:12,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993887352] [2020-02-10 20:13:12,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:12,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:12,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781855584] [2020-02-10 20:13:12,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:12,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:12,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:12,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:12,283 INFO L87 Difference]: Start difference. First operand 214 states and 644 transitions. Second operand 8 states. [2020-02-10 20:13:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:12,343 INFO L93 Difference]: Finished difference Result 334 states and 875 transitions. [2020-02-10 20:13:12,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:12,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:12,344 INFO L225 Difference]: With dead ends: 334 [2020-02-10 20:13:12,344 INFO L226 Difference]: Without dead ends: 322 [2020-02-10 20:13:12,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:12,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-02-10 20:13:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 212. [2020-02-10 20:13:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:13:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 639 transitions. [2020-02-10 20:13:12,349 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 639 transitions. Word has length 19 [2020-02-10 20:13:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:12,349 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 639 transitions. [2020-02-10 20:13:12,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 639 transitions. [2020-02-10 20:13:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:12,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:12,350 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:12,350 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:12,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:12,350 INFO L82 PathProgramCache]: Analyzing trace with hash 690097182, now seen corresponding path program 219 times [2020-02-10 20:13:12,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:12,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421098640] [2020-02-10 20:13:12,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:12,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421098640] [2020-02-10 20:13:12,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:12,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:12,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237421624] [2020-02-10 20:13:12,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:12,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:12,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:12,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:12,524 INFO L87 Difference]: Start difference. First operand 212 states and 639 transitions. Second operand 8 states. [2020-02-10 20:13:12,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:12,600 INFO L93 Difference]: Finished difference Result 342 states and 896 transitions. [2020-02-10 20:13:12,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:12,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:12,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:12,601 INFO L225 Difference]: With dead ends: 342 [2020-02-10 20:13:12,601 INFO L226 Difference]: Without dead ends: 328 [2020-02-10 20:13:12,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:12,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-02-10 20:13:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 216. [2020-02-10 20:13:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:13:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 647 transitions. [2020-02-10 20:13:12,607 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 647 transitions. Word has length 19 [2020-02-10 20:13:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:12,607 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 647 transitions. [2020-02-10 20:13:12,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 647 transitions. [2020-02-10 20:13:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:12,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:12,608 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:12,608 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:12,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:12,608 INFO L82 PathProgramCache]: Analyzing trace with hash -55199962, now seen corresponding path program 220 times [2020-02-10 20:13:12,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:12,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622682193] [2020-02-10 20:13:12,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:12,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:13:12,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622682193] [2020-02-10 20:13:12,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:12,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:12,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781555654] [2020-02-10 20:13:12,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:12,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:12,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:12,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:12,795 INFO L87 Difference]: Start difference. First operand 216 states and 647 transitions. Second operand 8 states. [2020-02-10 20:13:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:12,873 INFO L93 Difference]: Finished difference Result 340 states and 888 transitions. [2020-02-10 20:13:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:12,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:12,874 INFO L225 Difference]: With dead ends: 340 [2020-02-10 20:13:12,874 INFO L226 Difference]: Without dead ends: 324 [2020-02-10 20:13:12,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:12,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-02-10 20:13:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 212. [2020-02-10 20:13:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:13:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-02-10 20:13:12,880 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-02-10 20:13:12,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:12,880 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-02-10 20:13:12,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-02-10 20:13:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:12,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:12,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:12,881 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:12,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2019699708, now seen corresponding path program 221 times [2020-02-10 20:13:12,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:12,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939578092] [2020-02-10 20:13:12,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:13,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939578092] [2020-02-10 20:13:13,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:13,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:13,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410315360] [2020-02-10 20:13:13,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:13,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:13,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:13,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:13,063 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-02-10 20:13:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:13,121 INFO L93 Difference]: Finished difference Result 332 states and 869 transitions. [2020-02-10 20:13:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:13,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:13,122 INFO L225 Difference]: With dead ends: 332 [2020-02-10 20:13:13,123 INFO L226 Difference]: Without dead ends: 322 [2020-02-10 20:13:13,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:13,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-02-10 20:13:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 214. [2020-02-10 20:13:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 640 transitions. [2020-02-10 20:13:13,128 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 640 transitions. Word has length 19 [2020-02-10 20:13:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:13,128 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 640 transitions. [2020-02-10 20:13:13,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 640 transitions. [2020-02-10 20:13:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:13,128 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:13,128 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:13,128 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:13,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1164393054, now seen corresponding path program 222 times [2020-02-10 20:13:13,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:13,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455453222] [2020-02-10 20:13:13,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:13,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455453222] [2020-02-10 20:13:13,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:13,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:13,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290107398] [2020-02-10 20:13:13,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:13,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:13,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:13,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:13,308 INFO L87 Difference]: Start difference. First operand 214 states and 640 transitions. Second operand 8 states. [2020-02-10 20:13:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:13,387 INFO L93 Difference]: Finished difference Result 334 states and 872 transitions. [2020-02-10 20:13:13,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:13,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:13,388 INFO L225 Difference]: With dead ends: 334 [2020-02-10 20:13:13,388 INFO L226 Difference]: Without dead ends: 318 [2020-02-10 20:13:13,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-02-10 20:13:13,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 210. [2020-02-10 20:13:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 20:13:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 632 transitions. [2020-02-10 20:13:13,393 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 632 transitions. Word has length 19 [2020-02-10 20:13:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:13,393 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 632 transitions. [2020-02-10 20:13:13,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 632 transitions. [2020-02-10 20:13:13,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:13,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:13,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:13,394 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:13,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:13,394 INFO L82 PathProgramCache]: Analyzing trace with hash -165638174, now seen corresponding path program 223 times [2020-02-10 20:13:13,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:13,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411720726] [2020-02-10 20:13:13,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:13,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411720726] [2020-02-10 20:13:13,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:13,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:13,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924547215] [2020-02-10 20:13:13,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:13,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:13,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:13,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:13,588 INFO L87 Difference]: Start difference. First operand 210 states and 632 transitions. Second operand 8 states. [2020-02-10 20:13:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:13,666 INFO L93 Difference]: Finished difference Result 340 states and 889 transitions. [2020-02-10 20:13:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:13,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:13,667 INFO L225 Difference]: With dead ends: 340 [2020-02-10 20:13:13,667 INFO L226 Difference]: Without dead ends: 326 [2020-02-10 20:13:13,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:13,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-02-10 20:13:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 214. [2020-02-10 20:13:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-02-10 20:13:13,673 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-02-10 20:13:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:13,673 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-02-10 20:13:13,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-02-10 20:13:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:13,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:13,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:13,674 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:13,674 INFO L82 PathProgramCache]: Analyzing trace with hash 954491656, now seen corresponding path program 224 times [2020-02-10 20:13:13,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:13,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746878237] [2020-02-10 20:13:13,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:13,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746878237] [2020-02-10 20:13:13,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:13,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:13,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029924144] [2020-02-10 20:13:13,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:13,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:13,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:13,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:13,866 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-02-10 20:13:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:13,932 INFO L93 Difference]: Finished difference Result 336 states and 878 transitions. [2020-02-10 20:13:13,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:13,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:13,934 INFO L225 Difference]: With dead ends: 336 [2020-02-10 20:13:13,934 INFO L226 Difference]: Without dead ends: 324 [2020-02-10 20:13:13,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-02-10 20:13:13,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 212. [2020-02-10 20:13:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:13:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-02-10 20:13:13,941 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-02-10 20:13:13,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:13,941 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-02-10 20:13:13,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-02-10 20:13:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:13,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:13,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:13,942 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:13,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:13,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1238723554, now seen corresponding path program 225 times [2020-02-10 20:13:13,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:13,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282514946] [2020-02-10 20:13:13,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:14,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282514946] [2020-02-10 20:13:14,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:14,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:14,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731723928] [2020-02-10 20:13:14,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:14,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:14,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:14,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:14,175 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-02-10 20:13:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:14,253 INFO L93 Difference]: Finished difference Result 346 states and 904 transitions. [2020-02-10 20:13:14,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:14,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:14,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:14,254 INFO L225 Difference]: With dead ends: 346 [2020-02-10 20:13:14,255 INFO L226 Difference]: Without dead ends: 332 [2020-02-10 20:13:14,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-02-10 20:13:14,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 217. [2020-02-10 20:13:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 20:13:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 647 transitions. [2020-02-10 20:13:14,260 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 647 transitions. Word has length 19 [2020-02-10 20:13:14,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:14,261 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 647 transitions. [2020-02-10 20:13:14,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 647 transitions. [2020-02-10 20:13:14,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:14,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:14,261 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:14,261 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:14,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:14,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1880780472, now seen corresponding path program 226 times [2020-02-10 20:13:14,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:14,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20198005] [2020-02-10 20:13:14,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:14,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20198005] [2020-02-10 20:13:14,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:14,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:14,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996326572] [2020-02-10 20:13:14,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:14,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:14,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:14,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:14,458 INFO L87 Difference]: Start difference. First operand 217 states and 647 transitions. Second operand 8 states. [2020-02-10 20:13:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:14,542 INFO L93 Difference]: Finished difference Result 345 states and 897 transitions. [2020-02-10 20:13:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:14,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:14,543 INFO L225 Difference]: With dead ends: 345 [2020-02-10 20:13:14,543 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 20:13:14,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 20:13:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 212. [2020-02-10 20:13:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:13:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 635 transitions. [2020-02-10 20:13:14,549 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 635 transitions. Word has length 19 [2020-02-10 20:13:14,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:14,549 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 635 transitions. [2020-02-10 20:13:14,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:14,549 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 635 transitions. [2020-02-10 20:13:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:14,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:14,549 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:14,550 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:14,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2030202812, now seen corresponding path program 227 times [2020-02-10 20:13:14,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:14,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360313554] [2020-02-10 20:13:14,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:14,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:13:14,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360313554] [2020-02-10 20:13:14,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:14,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:14,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842277913] [2020-02-10 20:13:14,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:14,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:14,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:14,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:14,746 INFO L87 Difference]: Start difference. First operand 212 states and 635 transitions. Second operand 8 states. [2020-02-10 20:13:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:14,800 INFO L93 Difference]: Finished difference Result 335 states and 874 transitions. [2020-02-10 20:13:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:14,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:14,801 INFO L225 Difference]: With dead ends: 335 [2020-02-10 20:13:14,801 INFO L226 Difference]: Without dead ends: 325 [2020-02-10 20:13:14,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:14,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-02-10 20:13:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 214. [2020-02-10 20:13:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-02-10 20:13:14,806 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-02-10 20:13:14,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:14,806 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-02-10 20:13:14,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-02-10 20:13:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:14,807 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:14,807 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:14,807 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:14,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:14,807 INFO L82 PathProgramCache]: Analyzing trace with hash -775359488, now seen corresponding path program 228 times [2020-02-10 20:13:14,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:14,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871940345] [2020-02-10 20:13:14,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:15,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871940345] [2020-02-10 20:13:15,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:15,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:15,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191239225] [2020-02-10 20:13:15,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:15,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:15,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:15,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:15,007 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-02-10 20:13:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:15,091 INFO L93 Difference]: Finished difference Result 338 states and 879 transitions. [2020-02-10 20:13:15,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:15,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:15,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:15,092 INFO L225 Difference]: With dead ends: 338 [2020-02-10 20:13:15,092 INFO L226 Difference]: Without dead ends: 321 [2020-02-10 20:13:15,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-02-10 20:13:15,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 210. [2020-02-10 20:13:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 20:13:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 630 transitions. [2020-02-10 20:13:15,098 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 630 transitions. Word has length 19 [2020-02-10 20:13:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:15,098 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 630 transitions. [2020-02-10 20:13:15,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:15,098 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 630 transitions. [2020-02-10 20:13:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:15,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:15,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:15,099 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:15,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:15,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1784188770, now seen corresponding path program 229 times [2020-02-10 20:13:15,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:15,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851740466] [2020-02-10 20:13:15,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:15,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851740466] [2020-02-10 20:13:15,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:15,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:15,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428073796] [2020-02-10 20:13:15,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:15,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:15,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:15,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:15,290 INFO L87 Difference]: Start difference. First operand 210 states and 630 transitions. Second operand 8 states. [2020-02-10 20:13:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:15,372 INFO L93 Difference]: Finished difference Result 348 states and 911 transitions. [2020-02-10 20:13:15,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:15,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:15,374 INFO L225 Difference]: With dead ends: 348 [2020-02-10 20:13:15,374 INFO L226 Difference]: Without dead ends: 334 [2020-02-10 20:13:15,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-02-10 20:13:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 218. [2020-02-10 20:13:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:13:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-02-10 20:13:15,380 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-02-10 20:13:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:15,380 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-02-10 20:13:15,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-02-10 20:13:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:15,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:15,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:15,381 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:15,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:15,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1038891626, now seen corresponding path program 230 times [2020-02-10 20:13:15,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:15,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385717449] [2020-02-10 20:13:15,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:15,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385717449] [2020-02-10 20:13:15,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:15,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:15,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795668284] [2020-02-10 20:13:15,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:15,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:15,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:15,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:15,581 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-02-10 20:13:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:15,662 INFO L93 Difference]: Finished difference Result 346 states and 903 transitions. [2020-02-10 20:13:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:15,662 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:15,663 INFO L225 Difference]: With dead ends: 346 [2020-02-10 20:13:15,664 INFO L226 Difference]: Without dead ends: 330 [2020-02-10 20:13:15,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-02-10 20:13:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 214. [2020-02-10 20:13:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-02-10 20:13:15,669 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-02-10 20:13:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:15,669 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-02-10 20:13:15,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-02-10 20:13:15,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:15,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:15,670 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:15,670 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:15,670 INFO L82 PathProgramCache]: Analyzing trace with hash -165638174, now seen corresponding path program 231 times [2020-02-10 20:13:15,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:15,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826592730] [2020-02-10 20:13:15,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:15,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826592730] [2020-02-10 20:13:15,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:15,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:15,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118386059] [2020-02-10 20:13:15,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:15,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:15,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:15,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:15,875 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-02-10 20:13:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:15,950 INFO L93 Difference]: Finished difference Result 350 states and 912 transitions. [2020-02-10 20:13:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:15,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:15,951 INFO L225 Difference]: With dead ends: 350 [2020-02-10 20:13:15,951 INFO L226 Difference]: Without dead ends: 336 [2020-02-10 20:13:15,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:15,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-02-10 20:13:15,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 219. [2020-02-10 20:13:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 20:13:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 652 transitions. [2020-02-10 20:13:15,956 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 652 transitions. Word has length 19 [2020-02-10 20:13:15,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:15,957 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 652 transitions. [2020-02-10 20:13:15,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 652 transitions. [2020-02-10 20:13:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:15,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:15,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:15,957 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:15,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:15,958 INFO L82 PathProgramCache]: Analyzing trace with hash 803245866, now seen corresponding path program 232 times [2020-02-10 20:13:15,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:15,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32913815] [2020-02-10 20:13:15,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:16,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32913815] [2020-02-10 20:13:16,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:16,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:16,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813055608] [2020-02-10 20:13:16,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:16,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:16,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:16,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:16,148 INFO L87 Difference]: Start difference. First operand 219 states and 652 transitions. Second operand 8 states. [2020-02-10 20:13:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:16,235 INFO L93 Difference]: Finished difference Result 349 states and 905 transitions. [2020-02-10 20:13:16,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:16,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:16,236 INFO L225 Difference]: With dead ends: 349 [2020-02-10 20:13:16,236 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 20:13:16,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 20:13:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 214. [2020-02-10 20:13:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-02-10 20:13:16,241 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-02-10 20:13:16,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:16,241 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-02-10 20:13:16,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-02-10 20:13:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:16,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:16,242 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:16,242 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:16,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:16,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1685003648, now seen corresponding path program 233 times [2020-02-10 20:13:16,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:16,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233766674] [2020-02-10 20:13:16,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:16,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233766674] [2020-02-10 20:13:16,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:16,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:16,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549772083] [2020-02-10 20:13:16,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:16,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:16,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:16,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:16,433 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-02-10 20:13:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:16,503 INFO L93 Difference]: Finished difference Result 345 states and 897 transitions. [2020-02-10 20:13:16,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:16,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:16,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:16,504 INFO L225 Difference]: With dead ends: 345 [2020-02-10 20:13:16,504 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 20:13:16,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:16,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 20:13:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 218. [2020-02-10 20:13:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:13:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 646 transitions. [2020-02-10 20:13:16,510 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 646 transitions. Word has length 19 [2020-02-10 20:13:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:16,510 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 646 transitions. [2020-02-10 20:13:16,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 646 transitions. [2020-02-10 20:13:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:16,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:16,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:16,510 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:16,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:16,511 INFO L82 PathProgramCache]: Analyzing trace with hash -826129118, now seen corresponding path program 234 times [2020-02-10 20:13:16,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:16,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714553207] [2020-02-10 20:13:16,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:16,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714553207] [2020-02-10 20:13:16,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:16,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:16,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413486251] [2020-02-10 20:13:16,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:16,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:16,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:16,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:16,703 INFO L87 Difference]: Start difference. First operand 218 states and 646 transitions. Second operand 8 states. [2020-02-10 20:13:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:16,782 INFO L93 Difference]: Finished difference Result 346 states and 895 transitions. [2020-02-10 20:13:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:16,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:16,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:16,783 INFO L225 Difference]: With dead ends: 346 [2020-02-10 20:13:16,783 INFO L226 Difference]: Without dead ends: 325 [2020-02-10 20:13:16,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-02-10 20:13:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2020-02-10 20:13:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 20:13:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 628 transitions. [2020-02-10 20:13:16,789 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 628 transitions. Word has length 19 [2020-02-10 20:13:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:16,789 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 628 transitions. [2020-02-10 20:13:16,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 628 transitions. [2020-02-10 20:13:16,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:16,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:16,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:16,790 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:16,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:16,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1007007176, now seen corresponding path program 235 times [2020-02-10 20:13:16,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:16,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222990571] [2020-02-10 20:13:16,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:16,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:13:16,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222990571] [2020-02-10 20:13:16,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:16,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:16,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523028159] [2020-02-10 20:13:16,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:16,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:16,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:16,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:16,988 INFO L87 Difference]: Start difference. First operand 210 states and 628 transitions. Second operand 8 states. [2020-02-10 20:13:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:17,042 INFO L93 Difference]: Finished difference Result 327 states and 849 transitions. [2020-02-10 20:13:17,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:17,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:17,043 INFO L225 Difference]: With dead ends: 327 [2020-02-10 20:13:17,043 INFO L226 Difference]: Without dead ends: 317 [2020-02-10 20:13:17,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-02-10 20:13:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 214. [2020-02-10 20:13:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-02-10 20:13:17,049 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-02-10 20:13:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:17,049 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-02-10 20:13:17,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-02-10 20:13:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:17,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:17,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:17,050 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:17,050 INFO L82 PathProgramCache]: Analyzing trace with hash 151700522, now seen corresponding path program 236 times [2020-02-10 20:13:17,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:17,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900124112] [2020-02-10 20:13:17,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:17,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900124112] [2020-02-10 20:13:17,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:17,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:17,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051053972] [2020-02-10 20:13:17,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:17,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:17,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:17,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:17,246 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-02-10 20:13:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:17,329 INFO L93 Difference]: Finished difference Result 329 states and 852 transitions. [2020-02-10 20:13:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:17,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:17,330 INFO L225 Difference]: With dead ends: 329 [2020-02-10 20:13:17,330 INFO L226 Difference]: Without dead ends: 315 [2020-02-10 20:13:17,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-02-10 20:13:17,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 212. [2020-02-10 20:13:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:13:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 633 transitions. [2020-02-10 20:13:17,335 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 633 transitions. Word has length 19 [2020-02-10 20:13:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:17,335 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 633 transitions. [2020-02-10 20:13:17,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 633 transitions. [2020-02-10 20:13:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:17,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:17,335 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:17,335 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:17,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:17,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1677019162, now seen corresponding path program 237 times [2020-02-10 20:13:17,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:17,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049403024] [2020-02-10 20:13:17,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:17,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049403024] [2020-02-10 20:13:17,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:17,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:17,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463516316] [2020-02-10 20:13:17,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:17,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:17,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:17,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:17,533 INFO L87 Difference]: Start difference. First operand 212 states and 633 transitions. Second operand 8 states. [2020-02-10 20:13:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:17,586 INFO L93 Difference]: Finished difference Result 328 states and 849 transitions. [2020-02-10 20:13:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:17,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:17,587 INFO L225 Difference]: With dead ends: 328 [2020-02-10 20:13:17,587 INFO L226 Difference]: Without dead ends: 318 [2020-02-10 20:13:17,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-02-10 20:13:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 214. [2020-02-10 20:13:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 636 transitions. [2020-02-10 20:13:17,592 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 636 transitions. Word has length 19 [2020-02-10 20:13:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:17,592 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 636 transitions. [2020-02-10 20:13:17,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 636 transitions. [2020-02-10 20:13:17,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:17,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:17,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:17,593 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash -187614166, now seen corresponding path program 238 times [2020-02-10 20:13:17,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:17,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312938859] [2020-02-10 20:13:17,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:17,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312938859] [2020-02-10 20:13:17,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:17,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:17,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707929562] [2020-02-10 20:13:17,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:17,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:17,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:17,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:17,780 INFO L87 Difference]: Start difference. First operand 214 states and 636 transitions. Second operand 8 states. [2020-02-10 20:13:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:17,862 INFO L93 Difference]: Finished difference Result 331 states and 854 transitions. [2020-02-10 20:13:17,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:17,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:17,863 INFO L225 Difference]: With dead ends: 331 [2020-02-10 20:13:17,864 INFO L226 Difference]: Without dead ends: 316 [2020-02-10 20:13:17,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-02-10 20:13:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 212. [2020-02-10 20:13:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 20:13:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 631 transitions. [2020-02-10 20:13:17,868 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 631 transitions. Word has length 19 [2020-02-10 20:13:17,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:17,869 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 631 transitions. [2020-02-10 20:13:17,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 631 transitions. [2020-02-10 20:13:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:17,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:17,869 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:17,869 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:17,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:17,870 INFO L82 PathProgramCache]: Analyzing trace with hash -921384858, now seen corresponding path program 239 times [2020-02-10 20:13:17,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:17,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866716103] [2020-02-10 20:13:17,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:18,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:13:18,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866716103] [2020-02-10 20:13:18,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:18,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:18,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022410766] [2020-02-10 20:13:18,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:18,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:18,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:18,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:18,062 INFO L87 Difference]: Start difference. First operand 212 states and 631 transitions. Second operand 8 states. [2020-02-10 20:13:18,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:18,134 INFO L93 Difference]: Finished difference Result 330 states and 852 transitions. [2020-02-10 20:13:18,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:18,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:18,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:18,135 INFO L225 Difference]: With dead ends: 330 [2020-02-10 20:13:18,135 INFO L226 Difference]: Without dead ends: 318 [2020-02-10 20:13:18,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-02-10 20:13:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 216. [2020-02-10 20:13:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:13:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 639 transitions. [2020-02-10 20:13:18,141 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 639 transitions. Word has length 19 [2020-02-10 20:13:18,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:18,141 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 639 transitions. [2020-02-10 20:13:18,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 639 transitions. [2020-02-10 20:13:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:18,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:18,141 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:18,142 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:18,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:18,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1677019162, now seen corresponding path program 240 times [2020-02-10 20:13:18,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:18,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583401354] [2020-02-10 20:13:18,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:18,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583401354] [2020-02-10 20:13:18,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:18,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:18,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636499783] [2020-02-10 20:13:18,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:18,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:18,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:18,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:18,337 INFO L87 Difference]: Start difference. First operand 216 states and 639 transitions. Second operand 8 states. [2020-02-10 20:13:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:18,417 INFO L93 Difference]: Finished difference Result 331 states and 850 transitions. [2020-02-10 20:13:18,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:18,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:18,419 INFO L225 Difference]: With dead ends: 331 [2020-02-10 20:13:18,419 INFO L226 Difference]: Without dead ends: 304 [2020-02-10 20:13:18,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-02-10 20:13:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 202. [2020-02-10 20:13:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 20:13:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 613 transitions. [2020-02-10 20:13:18,424 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 613 transitions. Word has length 19 [2020-02-10 20:13:18,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:18,424 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 613 transitions. [2020-02-10 20:13:18,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 613 transitions. [2020-02-10 20:13:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:18,425 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:18,425 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:18,425 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:18,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1614896374, now seen corresponding path program 241 times [2020-02-10 20:13:18,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:18,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934764769] [2020-02-10 20:13:18,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:18,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934764769] [2020-02-10 20:13:18,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:18,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:18,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364029206] [2020-02-10 20:13:18,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:18,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:18,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:18,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:18,648 INFO L87 Difference]: Start difference. First operand 202 states and 613 transitions. Second operand 8 states. [2020-02-10 20:13:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:18,709 INFO L93 Difference]: Finished difference Result 378 states and 975 transitions. [2020-02-10 20:13:18,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:18,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:18,710 INFO L225 Difference]: With dead ends: 378 [2020-02-10 20:13:18,710 INFO L226 Difference]: Without dead ends: 362 [2020-02-10 20:13:18,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-02-10 20:13:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 218. [2020-02-10 20:13:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 20:13:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 653 transitions. [2020-02-10 20:13:18,715 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 653 transitions. Word has length 19 [2020-02-10 20:13:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:18,715 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 653 transitions. [2020-02-10 20:13:18,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 653 transitions. [2020-02-10 20:13:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:18,716 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:18,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:18,716 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:18,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:18,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1989547560, now seen corresponding path program 242 times [2020-02-10 20:13:18,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:18,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262488502] [2020-02-10 20:13:18,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:18,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262488502] [2020-02-10 20:13:18,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:18,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:18,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666521993] [2020-02-10 20:13:18,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:18,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:18,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:18,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:18,929 INFO L87 Difference]: Start difference. First operand 218 states and 653 transitions. Second operand 8 states. [2020-02-10 20:13:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:19,008 INFO L93 Difference]: Finished difference Result 376 states and 965 transitions. [2020-02-10 20:13:19,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:19,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:19,010 INFO L225 Difference]: With dead ends: 376 [2020-02-10 20:13:19,010 INFO L226 Difference]: Without dead ends: 354 [2020-02-10 20:13:19,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-02-10 20:13:19,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 210. [2020-02-10 20:13:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 20:13:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 632 transitions. [2020-02-10 20:13:19,015 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 632 transitions. Word has length 19 [2020-02-10 20:13:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:19,016 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 632 transitions. [2020-02-10 20:13:19,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 632 transitions. [2020-02-10 20:13:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:19,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:19,016 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:19,016 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:19,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:19,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1498681168, now seen corresponding path program 243 times [2020-02-10 20:13:19,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:19,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628029599] [2020-02-10 20:13:19,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:19,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628029599] [2020-02-10 20:13:19,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:19,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:19,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838722568] [2020-02-10 20:13:19,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:19,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:19,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:19,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:19,223 INFO L87 Difference]: Start difference. First operand 210 states and 632 transitions. Second operand 8 states. [2020-02-10 20:13:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:19,288 INFO L93 Difference]: Finished difference Result 375 states and 962 transitions. [2020-02-10 20:13:19,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:19,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:19,289 INFO L225 Difference]: With dead ends: 375 [2020-02-10 20:13:19,289 INFO L226 Difference]: Without dead ends: 359 [2020-02-10 20:13:19,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-02-10 20:13:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 216. [2020-02-10 20:13:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 20:13:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 643 transitions. [2020-02-10 20:13:19,294 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 643 transitions. Word has length 19 [2020-02-10 20:13:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:19,294 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 643 transitions. [2020-02-10 20:13:19,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 643 transitions. [2020-02-10 20:13:19,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:19,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:19,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:19,295 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:19,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:19,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1820081378, now seen corresponding path program 244 times [2020-02-10 20:13:19,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:19,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109800138] [2020-02-10 20:13:19,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:19,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109800138] [2020-02-10 20:13:19,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:19,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:19,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129277603] [2020-02-10 20:13:19,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:19,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:19,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:19,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:19,497 INFO L87 Difference]: Start difference. First operand 216 states and 643 transitions. Second operand 8 states. [2020-02-10 20:13:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:19,575 INFO L93 Difference]: Finished difference Result 372 states and 951 transitions. [2020-02-10 20:13:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:19,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:19,576 INFO L225 Difference]: With dead ends: 372 [2020-02-10 20:13:19,576 INFO L226 Difference]: Without dead ends: 353 [2020-02-10 20:13:19,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-02-10 20:13:19,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 210. [2020-02-10 20:13:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 20:13:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 626 transitions. [2020-02-10 20:13:19,581 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 626 transitions. Word has length 19 [2020-02-10 20:13:19,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:19,581 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 626 transitions. [2020-02-10 20:13:19,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:19,582 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 626 transitions. [2020-02-10 20:13:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:19,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:19,582 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:19,582 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:19,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:19,582 INFO L82 PathProgramCache]: Analyzing trace with hash -308913628, now seen corresponding path program 245 times [2020-02-10 20:13:19,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:19,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735181344] [2020-02-10 20:13:19,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:19,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735181344] [2020-02-10 20:13:19,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:19,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:19,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694138329] [2020-02-10 20:13:19,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:19,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:19,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:19,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:19,782 INFO L87 Difference]: Start difference. First operand 210 states and 626 transitions. Second operand 8 states. [2020-02-10 20:13:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:19,858 INFO L93 Difference]: Finished difference Result 370 states and 948 transitions. [2020-02-10 20:13:19,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:19,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:19,859 INFO L225 Difference]: With dead ends: 370 [2020-02-10 20:13:19,859 INFO L226 Difference]: Without dead ends: 356 [2020-02-10 20:13:19,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-02-10 20:13:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 215. [2020-02-10 20:13:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 20:13:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 636 transitions. [2020-02-10 20:13:19,864 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 636 transitions. Word has length 19 [2020-02-10 20:13:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:19,865 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 636 transitions. [2020-02-10 20:13:19,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 636 transitions. [2020-02-10 20:13:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:19,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:19,865 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:19,865 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:19,866 INFO L82 PathProgramCache]: Analyzing trace with hash 549366256, now seen corresponding path program 246 times [2020-02-10 20:13:19,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:19,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173546837] [2020-02-10 20:13:19,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:20,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173546837] [2020-02-10 20:13:20,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:20,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:20,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141469694] [2020-02-10 20:13:20,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:20,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:20,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:20,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:20,059 INFO L87 Difference]: Start difference. First operand 215 states and 636 transitions. Second operand 8 states. [2020-02-10 20:13:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:20,136 INFO L93 Difference]: Finished difference Result 369 states and 941 transitions. [2020-02-10 20:13:20,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:20,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:20,137 INFO L225 Difference]: With dead ends: 369 [2020-02-10 20:13:20,137 INFO L226 Difference]: Without dead ends: 343 [2020-02-10 20:13:20,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-02-10 20:13:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 202. [2020-02-10 20:13:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 20:13:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 608 transitions. [2020-02-10 20:13:20,143 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 608 transitions. Word has length 19 [2020-02-10 20:13:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:20,143 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 608 transitions. [2020-02-10 20:13:20,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 608 transitions. [2020-02-10 20:13:20,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:20,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:20,144 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:20,144 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:20,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:20,144 INFO L82 PathProgramCache]: Analyzing trace with hash -667701144, now seen corresponding path program 247 times [2020-02-10 20:13:20,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:20,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306251382] [2020-02-10 20:13:20,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:20,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:13:20,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306251382] [2020-02-10 20:13:20,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:20,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:20,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805043159] [2020-02-10 20:13:20,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:20,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:20,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:20,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:20,347 INFO L87 Difference]: Start difference. First operand 202 states and 608 transitions. Second operand 8 states. [2020-02-10 20:13:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:20,409 INFO L93 Difference]: Finished difference Result 365 states and 929 transitions. [2020-02-10 20:13:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:20,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:20,410 INFO L225 Difference]: With dead ends: 365 [2020-02-10 20:13:20,411 INFO L226 Difference]: Without dead ends: 349 [2020-02-10 20:13:20,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-02-10 20:13:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 214. [2020-02-10 20:13:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 20:13:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 634 transitions. [2020-02-10 20:13:20,416 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 634 transitions. Word has length 19 [2020-02-10 20:13:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:20,416 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 634 transitions. [2020-02-10 20:13:20,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 634 transitions. [2020-02-10 20:13:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:20,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:20,417 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:20,417 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:20,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:20,417 INFO L82 PathProgramCache]: Analyzing trace with hash -293049958, now seen corresponding path program 248 times [2020-02-10 20:13:20,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:20,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32119506] [2020-02-10 20:13:20,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:20,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32119506] [2020-02-10 20:13:20,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:20,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:20,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455918620] [2020-02-10 20:13:20,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:20,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:20,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:20,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:20,615 INFO L87 Difference]: Start difference. First operand 214 states and 634 transitions. Second operand 8 states. [2020-02-10 20:13:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:20,697 INFO L93 Difference]: Finished difference Result 363 states and 919 transitions. [2020-02-10 20:13:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:20,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:20,698 INFO L225 Difference]: With dead ends: 363 [2020-02-10 20:13:20,699 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 20:13:20,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:20,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 20:13:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 206. [2020-02-10 20:13:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-02-10 20:13:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 616 transitions. [2020-02-10 20:13:20,704 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 616 transitions. Word has length 19 [2020-02-10 20:13:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:20,704 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 616 transitions. [2020-02-10 20:13:20,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 616 transitions. [2020-02-10 20:13:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:20,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:20,705 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:20,705 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash -463100062, now seen corresponding path program 249 times [2020-02-10 20:13:20,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:20,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900980667] [2020-02-10 20:13:20,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:20,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900980667] [2020-02-10 20:13:20,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:20,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:20,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851510789] [2020-02-10 20:13:20,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:20,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:20,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:20,896 INFO L87 Difference]: Start difference. First operand 206 states and 616 transitions. Second operand 8 states. [2020-02-10 20:13:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:20,958 INFO L93 Difference]: Finished difference Result 356 states and 902 transitions. [2020-02-10 20:13:20,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:20,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:20,959 INFO L225 Difference]: With dead ends: 356 [2020-02-10 20:13:20,959 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 20:13:20,960 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:20,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 20:13:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 209. [2020-02-10 20:13:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-02-10 20:13:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 620 transitions. [2020-02-10 20:13:20,965 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 620 transitions. Word has length 19 [2020-02-10 20:13:20,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:20,965 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 620 transitions. [2020-02-10 20:13:20,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 620 transitions. [2020-02-10 20:13:20,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:20,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:20,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:20,966 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:20,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1680140688, now seen corresponding path program 250 times [2020-02-10 20:13:20,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:20,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490540828] [2020-02-10 20:13:20,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:21,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490540828] [2020-02-10 20:13:21,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:21,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:21,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584508367] [2020-02-10 20:13:21,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:21,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:21,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:21,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:21,178 INFO L87 Difference]: Start difference. First operand 209 states and 620 transitions. Second operand 8 states. [2020-02-10 20:13:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:21,250 INFO L93 Difference]: Finished difference Result 350 states and 887 transitions. [2020-02-10 20:13:21,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:21,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:21,251 INFO L225 Difference]: With dead ends: 350 [2020-02-10 20:13:21,251 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 20:13:21,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:21,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 20:13:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 206. [2020-02-10 20:13:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-02-10 20:13:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 613 transitions. [2020-02-10 20:13:21,259 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 613 transitions. Word has length 19 [2020-02-10 20:13:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:21,259 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 613 transitions. [2020-02-10 20:13:21,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:21,259 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 613 transitions. [2020-02-10 20:13:21,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:21,260 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:21,260 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:21,260 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:21,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1861116096, now seen corresponding path program 251 times [2020-02-10 20:13:21,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:21,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695783765] [2020-02-10 20:13:21,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:21,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695783765] [2020-02-10 20:13:21,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:21,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:21,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484726965] [2020-02-10 20:13:21,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:21,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:21,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:21,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:21,454 INFO L87 Difference]: Start difference. First operand 206 states and 613 transitions. Second operand 8 states. [2020-02-10 20:13:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:21,535 INFO L93 Difference]: Finished difference Result 351 states and 891 transitions. [2020-02-10 20:13:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:21,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:21,537 INFO L225 Difference]: With dead ends: 351 [2020-02-10 20:13:21,537 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 20:13:21,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 20:13:21,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 208. [2020-02-10 20:13:21,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 20:13:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 616 transitions. [2020-02-10 20:13:21,543 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 616 transitions. Word has length 19 [2020-02-10 20:13:21,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:21,543 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 616 transitions. [2020-02-10 20:13:21,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:21,543 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 616 transitions. [2020-02-10 20:13:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:21,544 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:21,544 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:21,544 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:21,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:21,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1559515874, now seen corresponding path program 252 times [2020-02-10 20:13:21,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:21,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208751162] [2020-02-10 20:13:21,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:21,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208751162] [2020-02-10 20:13:21,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:21,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:21,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700274542] [2020-02-10 20:13:21,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:21,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:21,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:21,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:21,728 INFO L87 Difference]: Start difference. First operand 208 states and 616 transitions. Second operand 8 states. [2020-02-10 20:13:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:21,807 INFO L93 Difference]: Finished difference Result 347 states and 880 transitions. [2020-02-10 20:13:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:21,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:21,810 INFO L225 Difference]: With dead ends: 347 [2020-02-10 20:13:21,810 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 20:13:21,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 20:13:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 202. [2020-02-10 20:13:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 20:13:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 604 transitions. [2020-02-10 20:13:21,815 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 604 transitions. Word has length 19 [2020-02-10 20:13:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:21,816 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 604 transitions. [2020-02-10 20:13:21,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 604 transitions. [2020-02-10 20:13:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:21,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:21,816 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:21,817 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:21,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1800243944, now seen corresponding path program 253 times [2020-02-10 20:13:21,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:21,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720606561] [2020-02-10 20:13:21,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:22,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720606561] [2020-02-10 20:13:22,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:22,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:22,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857574242] [2020-02-10 20:13:22,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:22,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:22,004 INFO L87 Difference]: Start difference. First operand 202 states and 604 transitions. Second operand 8 states. [2020-02-10 20:13:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:22,066 INFO L93 Difference]: Finished difference Result 352 states and 894 transitions. [2020-02-10 20:13:22,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:22,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:22,068 INFO L225 Difference]: With dead ends: 352 [2020-02-10 20:13:22,068 INFO L226 Difference]: Without dead ends: 336 [2020-02-10 20:13:22,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-02-10 20:13:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 208. [2020-02-10 20:13:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 20:13:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 618 transitions. [2020-02-10 20:13:22,073 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 618 transitions. Word has length 19 [2020-02-10 20:13:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:22,074 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 618 transitions. [2020-02-10 20:13:22,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 618 transitions. [2020-02-10 20:13:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:22,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:22,074 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:22,074 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:22,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash -351482602, now seen corresponding path program 254 times [2020-02-10 20:13:22,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:22,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000689420] [2020-02-10 20:13:22,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:22,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000689420] [2020-02-10 20:13:22,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:22,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:22,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805081448] [2020-02-10 20:13:22,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:22,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:22,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:22,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:22,270 INFO L87 Difference]: Start difference. First operand 208 states and 618 transitions. Second operand 8 states. [2020-02-10 20:13:22,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:22,354 INFO L93 Difference]: Finished difference Result 346 states and 879 transitions. [2020-02-10 20:13:22,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:22,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:22,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:22,356 INFO L225 Difference]: With dead ends: 346 [2020-02-10 20:13:22,356 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 20:13:22,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 20:13:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 205. [2020-02-10 20:13:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-02-10 20:13:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 611 transitions. [2020-02-10 20:13:22,361 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 611 transitions. Word has length 19 [2020-02-10 20:13:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:22,361 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 611 transitions. [2020-02-10 20:13:22,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 611 transitions. [2020-02-10 20:13:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:22,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:22,362 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:22,362 INFO L427 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:22,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:22,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1293897678, now seen corresponding path program 255 times [2020-02-10 20:13:22,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:22,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921102602] [2020-02-10 20:13:22,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:22,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921102602] [2020-02-10 20:13:22,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:22,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:22,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862818684] [2020-02-10 20:13:22,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:22,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:22,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:22,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:22,548 INFO L87 Difference]: Start difference. First operand 205 states and 611 transitions. Second operand 8 states. [2020-02-10 20:13:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:22,606 INFO L93 Difference]: Finished difference Result 358 states and 908 transitions. [2020-02-10 20:13:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:22,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:22,607 INFO L225 Difference]: With dead ends: 358 [2020-02-10 20:13:22,607 INFO L226 Difference]: Without dead ends: 342 [2020-02-10 20:13:22,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-02-10 20:13:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 211. [2020-02-10 20:13:22,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 20:13:22,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 622 transitions. [2020-02-10 20:13:22,613 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 622 transitions. Word has length 19 [2020-02-10 20:13:22,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:22,613 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 622 transitions. [2020-02-10 20:13:22,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:22,613 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 622 transitions. [2020-02-10 20:13:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:22,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:22,613 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:22,613 INFO L427 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:22,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:22,614 INFO L82 PathProgramCache]: Analyzing trace with hash 317692928, now seen corresponding path program 256 times [2020-02-10 20:13:22,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:22,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549100652] [2020-02-10 20:13:22,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:22,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549100652] [2020-02-10 20:13:22,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:22,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:22,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123601025] [2020-02-10 20:13:22,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:22,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:22,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:22,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:22,794 INFO L87 Difference]: Start difference. First operand 211 states and 622 transitions. Second operand 8 states. [2020-02-10 20:13:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:22,870 INFO L93 Difference]: Finished difference Result 355 states and 897 transitions. [2020-02-10 20:13:22,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:22,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:22,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:22,871 INFO L225 Difference]: With dead ends: 355 [2020-02-10 20:13:22,872 INFO L226 Difference]: Without dead ends: 336 [2020-02-10 20:13:22,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-02-10 20:13:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 205. [2020-02-10 20:13:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-02-10 20:13:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 608 transitions. [2020-02-10 20:13:22,877 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 608 transitions. Word has length 19 [2020-02-10 20:13:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:22,877 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 608 transitions. [2020-02-10 20:13:22,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 608 transitions. [2020-02-10 20:13:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:22,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:22,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:22,878 INFO L427 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:22,878 INFO L82 PathProgramCache]: Analyzing trace with hash -235841100, now seen corresponding path program 257 times [2020-02-10 20:13:22,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:22,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973818810] [2020-02-10 20:13:22,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:23,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973818810] [2020-02-10 20:13:23,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:23,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:23,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488771655] [2020-02-10 20:13:23,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:23,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:23,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:23,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:23,052 INFO L87 Difference]: Start difference. First operand 205 states and 608 transitions. Second operand 8 states. [2020-02-10 20:13:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:23,140 INFO L93 Difference]: Finished difference Result 342 states and 869 transitions. [2020-02-10 20:13:23,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:23,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:23,141 INFO L225 Difference]: With dead ends: 342 [2020-02-10 20:13:23,141 INFO L226 Difference]: Without dead ends: 332 [2020-02-10 20:13:23,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-02-10 20:13:23,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 207. [2020-02-10 20:13:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-02-10 20:13:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 611 transitions. [2020-02-10 20:13:23,145 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 611 transitions. Word has length 19 [2020-02-10 20:13:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:23,145 INFO L479 AbstractCegarLoop]: Abstraction has 207 states and 611 transitions. [2020-02-10 20:13:23,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 611 transitions. [2020-02-10 20:13:23,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:23,146 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:23,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:23,146 INFO L427 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:23,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:23,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1964888434, now seen corresponding path program 258 times [2020-02-10 20:13:23,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:23,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235523842] [2020-02-10 20:13:23,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:23,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235523842] [2020-02-10 20:13:23,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:23,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:23,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667302994] [2020-02-10 20:13:23,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:23,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:23,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:23,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:23,323 INFO L87 Difference]: Start difference. First operand 207 states and 611 transitions. Second operand 8 states. [2020-02-10 20:13:23,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:23,403 INFO L93 Difference]: Finished difference Result 345 states and 874 transitions. [2020-02-10 20:13:23,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:23,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:23,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:23,405 INFO L225 Difference]: With dead ends: 345 [2020-02-10 20:13:23,405 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 20:13:23,405 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 20:13:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 202. [2020-02-10 20:13:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 20:13:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 601 transitions. [2020-02-10 20:13:23,411 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 601 transitions. Word has length 19 [2020-02-10 20:13:23,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:23,411 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 601 transitions. [2020-02-10 20:13:23,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 601 transitions. [2020-02-10 20:13:23,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:23,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:23,412 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:23,412 INFO L427 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:23,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:23,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1020844596, now seen corresponding path program 259 times [2020-02-10 20:13:23,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:23,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332357369] [2020-02-10 20:13:23,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:23,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:13:23,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332357369] [2020-02-10 20:13:23,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:23,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:23,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404710100] [2020-02-10 20:13:23,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:23,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:23,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:23,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:23,613 INFO L87 Difference]: Start difference. First operand 202 states and 601 transitions. Second operand 8 states. [2020-02-10 20:13:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:23,696 INFO L93 Difference]: Finished difference Result 342 states and 873 transitions. [2020-02-10 20:13:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:23,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:23,697 INFO L225 Difference]: With dead ends: 342 [2020-02-10 20:13:23,697 INFO L226 Difference]: Without dead ends: 328 [2020-02-10 20:13:23,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-02-10 20:13:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 206. [2020-02-10 20:13:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-02-10 20:13:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 611 transitions. [2020-02-10 20:13:23,702 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 611 transitions. Word has length 19 [2020-02-10 20:13:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:23,703 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 611 transitions. [2020-02-10 20:13:23,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 611 transitions. [2020-02-10 20:13:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:23,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:23,703 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:23,703 INFO L427 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:23,704 INFO L82 PathProgramCache]: Analyzing trace with hash 146509270, now seen corresponding path program 260 times [2020-02-10 20:13:23,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:23,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278868059] [2020-02-10 20:13:23,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:23,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278868059] [2020-02-10 20:13:23,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:23,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:23,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745283192] [2020-02-10 20:13:23,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:23,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:23,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:23,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:23,879 INFO L87 Difference]: Start difference. First operand 206 states and 611 transitions. Second operand 8 states. [2020-02-10 20:13:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:23,959 INFO L93 Difference]: Finished difference Result 338 states and 862 transitions. [2020-02-10 20:13:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:23,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:23,960 INFO L225 Difference]: With dead ends: 338 [2020-02-10 20:13:23,960 INFO L226 Difference]: Without dead ends: 326 [2020-02-10 20:13:23,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-02-10 20:13:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 204. [2020-02-10 20:13:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-02-10 20:13:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 606 transitions. [2020-02-10 20:13:23,965 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 606 transitions. Word has length 19 [2020-02-10 20:13:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:23,965 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 606 transitions. [2020-02-10 20:13:23,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:23,965 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 606 transitions. [2020-02-10 20:13:23,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:23,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:23,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:23,966 INFO L427 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:23,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:23,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1040015206, now seen corresponding path program 261 times [2020-02-10 20:13:23,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:23,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392244755] [2020-02-10 20:13:23,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:24,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392244755] [2020-02-10 20:13:24,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:24,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:24,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171541226] [2020-02-10 20:13:24,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:24,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:24,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:24,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:24,146 INFO L87 Difference]: Start difference. First operand 204 states and 606 transitions. Second operand 8 states. [2020-02-10 20:13:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:24,224 INFO L93 Difference]: Finished difference Result 348 states and 888 transitions. [2020-02-10 20:13:24,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:24,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:24,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:24,226 INFO L225 Difference]: With dead ends: 348 [2020-02-10 20:13:24,226 INFO L226 Difference]: Without dead ends: 334 [2020-02-10 20:13:24,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-02-10 20:13:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 209. [2020-02-10 20:13:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-02-10 20:13:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 616 transitions. [2020-02-10 20:13:24,231 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 616 transitions. Word has length 19 [2020-02-10 20:13:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:24,231 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 616 transitions. [2020-02-10 20:13:24,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 616 transitions. [2020-02-10 20:13:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:24,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:24,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:24,232 INFO L427 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:24,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:24,232 INFO L82 PathProgramCache]: Analyzing trace with hash -71131166, now seen corresponding path program 262 times [2020-02-10 20:13:24,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:24,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998343793] [2020-02-10 20:13:24,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:24,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998343793] [2020-02-10 20:13:24,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:24,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:24,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360533373] [2020-02-10 20:13:24,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:24,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:24,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:24,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:24,412 INFO L87 Difference]: Start difference. First operand 209 states and 616 transitions. Second operand 8 states. [2020-02-10 20:13:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:24,503 INFO L93 Difference]: Finished difference Result 347 states and 881 transitions. [2020-02-10 20:13:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:24,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:24,504 INFO L225 Difference]: With dead ends: 347 [2020-02-10 20:13:24,504 INFO L226 Difference]: Without dead ends: 329 [2020-02-10 20:13:24,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-02-10 20:13:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 204. [2020-02-10 20:13:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-02-10 20:13:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 604 transitions. [2020-02-10 20:13:24,511 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 604 transitions. Word has length 19 [2020-02-10 20:13:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:24,511 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 604 transitions. [2020-02-10 20:13:24,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 604 transitions. [2020-02-10 20:13:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:24,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:24,512 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:24,512 INFO L427 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:24,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:24,512 INFO L82 PathProgramCache]: Analyzing trace with hash 319756962, now seen corresponding path program 263 times [2020-02-10 20:13:24,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:24,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53068139] [2020-02-10 20:13:24,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:24,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53068139] [2020-02-10 20:13:24,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:24,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:24,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656319561] [2020-02-10 20:13:24,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:24,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:24,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:24,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:24,731 INFO L87 Difference]: Start difference. First operand 204 states and 604 transitions. Second operand 8 states. [2020-02-10 20:13:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:24,801 INFO L93 Difference]: Finished difference Result 337 states and 858 transitions. [2020-02-10 20:13:24,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:24,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:24,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:24,803 INFO L225 Difference]: With dead ends: 337 [2020-02-10 20:13:24,803 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 20:13:24,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 20:13:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 206. [2020-02-10 20:13:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-02-10 20:13:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 607 transitions. [2020-02-10 20:13:24,810 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 607 transitions. Word has length 19 [2020-02-10 20:13:24,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:24,810 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 607 transitions. [2020-02-10 20:13:24,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 607 transitions. [2020-02-10 20:13:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:24,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:24,811 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:24,811 INFO L427 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:24,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:24,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1409290372, now seen corresponding path program 264 times [2020-02-10 20:13:24,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:24,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608627006] [2020-02-10 20:13:24,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:24,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608627006] [2020-02-10 20:13:24,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:24,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:24,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715324865] [2020-02-10 20:13:24,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:24,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:24,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:24,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:24,986 INFO L87 Difference]: Start difference. First operand 206 states and 607 transitions. Second operand 8 states. [2020-02-10 20:13:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:25,067 INFO L93 Difference]: Finished difference Result 340 states and 863 transitions. [2020-02-10 20:13:25,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:25,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:25,068 INFO L225 Difference]: With dead ends: 340 [2020-02-10 20:13:25,068 INFO L226 Difference]: Without dead ends: 318 [2020-02-10 20:13:25,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-02-10 20:13:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 197. [2020-02-10 20:13:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-02-10 20:13:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 591 transitions. [2020-02-10 20:13:25,074 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 591 transitions. Word has length 19 [2020-02-10 20:13:25,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:25,074 INFO L479 AbstractCegarLoop]: Abstraction has 197 states and 591 transitions. [2020-02-10 20:13:25,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 591 transitions. [2020-02-10 20:13:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:25,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:25,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:25,075 INFO L427 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:25,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:25,075 INFO L82 PathProgramCache]: Analyzing trace with hash -666960488, now seen corresponding path program 265 times [2020-02-10 20:13:25,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:25,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695860415] [2020-02-10 20:13:25,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:25,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695860415] [2020-02-10 20:13:25,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:25,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:25,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443788850] [2020-02-10 20:13:25,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:25,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:25,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:25,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:25,289 INFO L87 Difference]: Start difference. First operand 197 states and 591 transitions. Second operand 8 states. [2020-02-10 20:13:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:25,344 INFO L93 Difference]: Finished difference Result 365 states and 927 transitions. [2020-02-10 20:13:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:25,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:25,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:25,345 INFO L225 Difference]: With dead ends: 365 [2020-02-10 20:13:25,345 INFO L226 Difference]: Without dead ends: 349 [2020-02-10 20:13:25,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-02-10 20:13:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 205. [2020-02-10 20:13:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-02-10 20:13:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 605 transitions. [2020-02-10 20:13:25,350 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 605 transitions. Word has length 19 [2020-02-10 20:13:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:25,350 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 605 transitions. [2020-02-10 20:13:25,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 605 transitions. [2020-02-10 20:13:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:25,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:25,350 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:25,350 INFO L427 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash -292309302, now seen corresponding path program 266 times [2020-02-10 20:13:25,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:25,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883242357] [2020-02-10 20:13:25,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:25,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883242357] [2020-02-10 20:13:25,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:25,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:25,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872119705] [2020-02-10 20:13:25,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:25,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:25,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:25,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:25,555 INFO L87 Difference]: Start difference. First operand 205 states and 605 transitions. Second operand 8 states. [2020-02-10 20:13:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:25,629 INFO L93 Difference]: Finished difference Result 363 states and 917 transitions. [2020-02-10 20:13:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:25,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:25,630 INFO L225 Difference]: With dead ends: 363 [2020-02-10 20:13:25,630 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 20:13:25,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 20:13:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 197. [2020-02-10 20:13:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-02-10 20:13:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 584 transitions. [2020-02-10 20:13:25,635 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 584 transitions. Word has length 19 [2020-02-10 20:13:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:25,635 INFO L479 AbstractCegarLoop]: Abstraction has 197 states and 584 transitions. [2020-02-10 20:13:25,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 584 transitions. [2020-02-10 20:13:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:25,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:25,636 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:25,636 INFO L427 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:25,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash 514429266, now seen corresponding path program 267 times [2020-02-10 20:13:25,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:25,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002320558] [2020-02-10 20:13:25,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:25,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002320558] [2020-02-10 20:13:25,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:25,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:25,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405459432] [2020-02-10 20:13:25,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:25,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:25,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:25,845 INFO L87 Difference]: Start difference. First operand 197 states and 584 transitions. Second operand 8 states. [2020-02-10 20:13:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:25,898 INFO L93 Difference]: Finished difference Result 362 states and 914 transitions. [2020-02-10 20:13:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:25,898 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:25,899 INFO L225 Difference]: With dead ends: 362 [2020-02-10 20:13:25,900 INFO L226 Difference]: Without dead ends: 346 [2020-02-10 20:13:25,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-02-10 20:13:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 203. [2020-02-10 20:13:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-02-10 20:13:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 595 transitions. [2020-02-10 20:13:25,905 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 595 transitions. Word has length 19 [2020-02-10 20:13:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:25,905 INFO L479 AbstractCegarLoop]: Abstraction has 203 states and 595 transitions. [2020-02-10 20:13:25,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 595 transitions. [2020-02-10 20:13:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:25,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:25,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:25,906 INFO L427 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:25,906 INFO L82 PathProgramCache]: Analyzing trace with hash -461775484, now seen corresponding path program 268 times [2020-02-10 20:13:25,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:25,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597715229] [2020-02-10 20:13:25,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:26,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597715229] [2020-02-10 20:13:26,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:26,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:26,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550502126] [2020-02-10 20:13:26,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:26,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:26,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:26,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:26,118 INFO L87 Difference]: Start difference. First operand 203 states and 595 transitions. Second operand 8 states. [2020-02-10 20:13:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:26,195 INFO L93 Difference]: Finished difference Result 359 states and 903 transitions. [2020-02-10 20:13:26,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:26,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:26,197 INFO L225 Difference]: With dead ends: 359 [2020-02-10 20:13:26,197 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 20:13:26,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 20:13:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 197. [2020-02-10 20:13:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-02-10 20:13:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 578 transitions. [2020-02-10 20:13:26,202 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 578 transitions. Word has length 19 [2020-02-10 20:13:26,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:26,202 INFO L479 AbstractCegarLoop]: Abstraction has 197 states and 578 transitions. [2020-02-10 20:13:26,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 578 transitions. [2020-02-10 20:13:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:26,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:26,203 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:26,203 INFO L427 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:26,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:26,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1704196806, now seen corresponding path program 269 times [2020-02-10 20:13:26,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:26,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39377173] [2020-02-10 20:13:26,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:26,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39377173] [2020-02-10 20:13:26,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:26,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:26,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117753705] [2020-02-10 20:13:26,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:26,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:26,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:26,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:26,410 INFO L87 Difference]: Start difference. First operand 197 states and 578 transitions. Second operand 8 states. [2020-02-10 20:13:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:26,488 INFO L93 Difference]: Finished difference Result 357 states and 900 transitions. [2020-02-10 20:13:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:26,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:26,489 INFO L225 Difference]: With dead ends: 357 [2020-02-10 20:13:26,489 INFO L226 Difference]: Without dead ends: 343 [2020-02-10 20:13:26,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:26,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-02-10 20:13:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 202. [2020-02-10 20:13:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 20:13:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 588 transitions. [2020-02-10 20:13:26,493 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 588 transitions. Word has length 19 [2020-02-10 20:13:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:26,494 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 588 transitions. [2020-02-10 20:13:26,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 588 transitions. [2020-02-10 20:13:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:26,494 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:26,494 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:26,494 INFO L427 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:26,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:26,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1732490606, now seen corresponding path program 270 times [2020-02-10 20:13:26,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:26,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736657744] [2020-02-10 20:13:26,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:26,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736657744] [2020-02-10 20:13:26,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:26,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:26,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130923969] [2020-02-10 20:13:26,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:26,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:26,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:26,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:26,722 INFO L87 Difference]: Start difference. First operand 202 states and 588 transitions. Second operand 8 states. [2020-02-10 20:13:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:26,801 INFO L93 Difference]: Finished difference Result 356 states and 893 transitions. [2020-02-10 20:13:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:26,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:26,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:26,802 INFO L225 Difference]: With dead ends: 356 [2020-02-10 20:13:26,802 INFO L226 Difference]: Without dead ends: 330 [2020-02-10 20:13:26,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-02-10 20:13:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 189. [2020-02-10 20:13:26,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 560 transitions. [2020-02-10 20:13:26,807 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 560 transitions. Word has length 19 [2020-02-10 20:13:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:26,807 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 560 transitions. [2020-02-10 20:13:26,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 560 transitions. [2020-02-10 20:13:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:26,807 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:26,807 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:26,808 INFO L427 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:26,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:26,808 INFO L82 PathProgramCache]: Analyzing trace with hash 710767946, now seen corresponding path program 271 times [2020-02-10 20:13:26,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:26,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110689576] [2020-02-10 20:13:26,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:27,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110689576] [2020-02-10 20:13:27,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:27,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:27,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626194855] [2020-02-10 20:13:27,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:27,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:27,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:27,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:27,018 INFO L87 Difference]: Start difference. First operand 189 states and 560 transitions. Second operand 8 states. [2020-02-10 20:13:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:27,075 INFO L93 Difference]: Finished difference Result 344 states and 860 transitions. [2020-02-10 20:13:27,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:27,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:27,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:27,076 INFO L225 Difference]: With dead ends: 344 [2020-02-10 20:13:27,077 INFO L226 Difference]: Without dead ends: 328 [2020-02-10 20:13:27,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-02-10 20:13:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 201. [2020-02-10 20:13:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-02-10 20:13:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 586 transitions. [2020-02-10 20:13:27,081 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 586 transitions. Word has length 19 [2020-02-10 20:13:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:27,081 INFO L479 AbstractCegarLoop]: Abstraction has 201 states and 586 transitions. [2020-02-10 20:13:27,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 586 transitions. [2020-02-10 20:13:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:27,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:27,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:27,082 INFO L427 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:27,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:27,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1085419132, now seen corresponding path program 272 times [2020-02-10 20:13:27,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:27,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553328187] [2020-02-10 20:13:27,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:27,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553328187] [2020-02-10 20:13:27,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:27,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:27,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191959983] [2020-02-10 20:13:27,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:27,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:27,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:27,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:27,293 INFO L87 Difference]: Start difference. First operand 201 states and 586 transitions. Second operand 8 states. [2020-02-10 20:13:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:27,374 INFO L93 Difference]: Finished difference Result 342 states and 850 transitions. [2020-02-10 20:13:27,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:27,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:27,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:27,375 INFO L225 Difference]: With dead ends: 342 [2020-02-10 20:13:27,375 INFO L226 Difference]: Without dead ends: 320 [2020-02-10 20:13:27,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-02-10 20:13:27,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 193. [2020-02-10 20:13:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 20:13:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 568 transitions. [2020-02-10 20:13:27,380 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 568 transitions. Word has length 19 [2020-02-10 20:13:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:27,380 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 568 transitions. [2020-02-10 20:13:27,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 568 transitions. [2020-02-10 20:13:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:27,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:27,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:27,381 INFO L427 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:27,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:27,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1240965252, now seen corresponding path program 273 times [2020-02-10 20:13:27,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:27,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536597454] [2020-02-10 20:13:27,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:27,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536597454] [2020-02-10 20:13:27,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:27,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:27,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77527311] [2020-02-10 20:13:27,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:27,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:27,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:27,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:27,585 INFO L87 Difference]: Start difference. First operand 193 states and 568 transitions. Second operand 8 states. [2020-02-10 20:13:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:27,646 INFO L93 Difference]: Finished difference Result 327 states and 818 transitions. [2020-02-10 20:13:27,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:27,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:27,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:27,647 INFO L225 Difference]: With dead ends: 327 [2020-02-10 20:13:27,647 INFO L226 Difference]: Without dead ends: 311 [2020-02-10 20:13:27,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:27,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-02-10 20:13:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 196. [2020-02-10 20:13:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-02-10 20:13:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 572 transitions. [2020-02-10 20:13:27,652 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 572 transitions. Word has length 19 [2020-02-10 20:13:27,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:27,652 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 572 transitions. [2020-02-10 20:13:27,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:27,652 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 572 transitions. [2020-02-10 20:13:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:27,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:27,652 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:27,653 INFO L427 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:27,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:27,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1500023478, now seen corresponding path program 274 times [2020-02-10 20:13:27,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:27,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051123210] [2020-02-10 20:13:27,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:27,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051123210] [2020-02-10 20:13:27,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:27,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:27,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585177661] [2020-02-10 20:13:27,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:27,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:27,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:27,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:27,847 INFO L87 Difference]: Start difference. First operand 196 states and 572 transitions. Second operand 8 states. [2020-02-10 20:13:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:27,905 INFO L93 Difference]: Finished difference Result 312 states and 794 transitions. [2020-02-10 20:13:27,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:27,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:27,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:27,906 INFO L225 Difference]: With dead ends: 312 [2020-02-10 20:13:27,906 INFO L226 Difference]: Without dead ends: 299 [2020-02-10 20:13:27,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:27,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-02-10 20:13:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 193. [2020-02-10 20:13:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 20:13:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 565 transitions. [2020-02-10 20:13:27,911 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 565 transitions. Word has length 19 [2020-02-10 20:13:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:27,911 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 565 transitions. [2020-02-10 20:13:27,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 565 transitions. [2020-02-10 20:13:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:27,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:27,912 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:27,912 INFO L427 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1131696324, now seen corresponding path program 275 times [2020-02-10 20:13:27,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:27,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340759518] [2020-02-10 20:13:27,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:28,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340759518] [2020-02-10 20:13:28,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:28,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:28,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333517663] [2020-02-10 20:13:28,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:28,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:28,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:28,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:28,103 INFO L87 Difference]: Start difference. First operand 193 states and 565 transitions. Second operand 8 states. [2020-02-10 20:13:28,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:28,184 INFO L93 Difference]: Finished difference Result 324 states and 810 transitions. [2020-02-10 20:13:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:28,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:28,185 INFO L225 Difference]: With dead ends: 324 [2020-02-10 20:13:28,185 INFO L226 Difference]: Without dead ends: 310 [2020-02-10 20:13:28,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-02-10 20:13:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 195. [2020-02-10 20:13:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-02-10 20:13:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 568 transitions. [2020-02-10 20:13:28,189 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 568 transitions. Word has length 19 [2020-02-10 20:13:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:28,190 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 568 transitions. [2020-02-10 20:13:28,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 568 transitions. [2020-02-10 20:13:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:28,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:28,190 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:28,190 INFO L427 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:28,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:28,190 INFO L82 PathProgramCache]: Analyzing trace with hash -11566494, now seen corresponding path program 276 times [2020-02-10 20:13:28,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:28,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079623247] [2020-02-10 20:13:28,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:28,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079623247] [2020-02-10 20:13:28,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:28,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:28,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311368621] [2020-02-10 20:13:28,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:28,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:28,393 INFO L87 Difference]: Start difference. First operand 195 states and 568 transitions. Second operand 8 states. [2020-02-10 20:13:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:28,458 INFO L93 Difference]: Finished difference Result 311 states and 790 transitions. [2020-02-10 20:13:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:28,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:28,459 INFO L225 Difference]: With dead ends: 311 [2020-02-10 20:13:28,459 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:13:28,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:13:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 189. [2020-02-10 20:13:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 556 transitions. [2020-02-10 20:13:28,464 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 556 transitions. Word has length 19 [2020-02-10 20:13:28,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:28,464 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 556 transitions. [2020-02-10 20:13:28,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 556 transitions. [2020-02-10 20:13:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:28,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:28,465 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:28,465 INFO L427 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:28,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:28,465 INFO L82 PathProgramCache]: Analyzing trace with hash -790658038, now seen corresponding path program 277 times [2020-02-10 20:13:28,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:28,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947010757] [2020-02-10 20:13:28,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:28,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:13:28,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947010757] [2020-02-10 20:13:28,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:28,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:28,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720648936] [2020-02-10 20:13:28,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:28,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:28,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:28,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:28,663 INFO L87 Difference]: Start difference. First operand 189 states and 556 transitions. Second operand 8 states. [2020-02-10 20:13:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:28,722 INFO L93 Difference]: Finished difference Result 339 states and 846 transitions. [2020-02-10 20:13:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:28,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:28,723 INFO L225 Difference]: With dead ends: 339 [2020-02-10 20:13:28,723 INFO L226 Difference]: Without dead ends: 323 [2020-02-10 20:13:28,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-02-10 20:13:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 195. [2020-02-10 20:13:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-02-10 20:13:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 570 transitions. [2020-02-10 20:13:28,728 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 570 transitions. Word has length 19 [2020-02-10 20:13:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:28,728 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 570 transitions. [2020-02-10 20:13:28,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:28,728 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 570 transitions. [2020-02-10 20:13:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:28,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:28,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:28,728 INFO L427 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:28,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash -531599812, now seen corresponding path program 278 times [2020-02-10 20:13:28,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:28,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989029096] [2020-02-10 20:13:28,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:28,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989029096] [2020-02-10 20:13:28,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:28,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:28,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016210621] [2020-02-10 20:13:28,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:28,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:28,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:28,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:28,924 INFO L87 Difference]: Start difference. First operand 195 states and 570 transitions. Second operand 8 states. [2020-02-10 20:13:28,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:28,983 INFO L93 Difference]: Finished difference Result 333 states and 831 transitions. [2020-02-10 20:13:28,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:28,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:28,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:28,984 INFO L225 Difference]: With dead ends: 333 [2020-02-10 20:13:28,985 INFO L226 Difference]: Without dead ends: 320 [2020-02-10 20:13:28,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-02-10 20:13:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 192. [2020-02-10 20:13:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:13:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 563 transitions. [2020-02-10 20:13:28,989 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 563 transitions. Word has length 19 [2020-02-10 20:13:28,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:28,989 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 563 transitions. [2020-02-10 20:13:28,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 563 transitions. [2020-02-10 20:13:28,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:28,990 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:28,990 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:28,990 INFO L427 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:28,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:28,990 INFO L82 PathProgramCache]: Analyzing trace with hash 303433550, now seen corresponding path program 279 times [2020-02-10 20:13:28,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:28,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965279077] [2020-02-10 20:13:28,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:29,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965279077] [2020-02-10 20:13:29,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:29,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:29,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358533635] [2020-02-10 20:13:29,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:29,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:29,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:29,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:29,198 INFO L87 Difference]: Start difference. First operand 192 states and 563 transitions. Second operand 8 states. [2020-02-10 20:13:29,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:29,262 INFO L93 Difference]: Finished difference Result 339 states and 843 transitions. [2020-02-10 20:13:29,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:29,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:29,263 INFO L225 Difference]: With dead ends: 339 [2020-02-10 20:13:29,263 INFO L226 Difference]: Without dead ends: 323 [2020-02-10 20:13:29,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-02-10 20:13:29,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 198. [2020-02-10 20:13:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-02-10 20:13:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 574 transitions. [2020-02-10 20:13:29,267 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 574 transitions. Word has length 19 [2020-02-10 20:13:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:29,268 INFO L479 AbstractCegarLoop]: Abstraction has 198 states and 574 transitions. [2020-02-10 20:13:29,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 574 transitions. [2020-02-10 20:13:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:29,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:29,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:29,268 INFO L427 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:29,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:29,269 INFO L82 PathProgramCache]: Analyzing trace with hash -672771200, now seen corresponding path program 280 times [2020-02-10 20:13:29,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:29,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210576703] [2020-02-10 20:13:29,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:29,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210576703] [2020-02-10 20:13:29,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:29,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:29,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342818647] [2020-02-10 20:13:29,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:29,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:29,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:29,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:29,466 INFO L87 Difference]: Start difference. First operand 198 states and 574 transitions. Second operand 8 states. [2020-02-10 20:13:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:29,550 INFO L93 Difference]: Finished difference Result 336 states and 832 transitions. [2020-02-10 20:13:29,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:29,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:29,551 INFO L225 Difference]: With dead ends: 336 [2020-02-10 20:13:29,552 INFO L226 Difference]: Without dead ends: 317 [2020-02-10 20:13:29,552 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-02-10 20:13:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 192. [2020-02-10 20:13:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:13:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 560 transitions. [2020-02-10 20:13:29,556 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 560 transitions. Word has length 19 [2020-02-10 20:13:29,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:29,556 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 560 transitions. [2020-02-10 20:13:29,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 560 transitions. [2020-02-10 20:13:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:29,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:29,557 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:29,557 INFO L427 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:29,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:29,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1980171160, now seen corresponding path program 281 times [2020-02-10 20:13:29,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:29,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346173057] [2020-02-10 20:13:29,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:29,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346173057] [2020-02-10 20:13:29,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:29,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:29,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000415818] [2020-02-10 20:13:29,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:29,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:29,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:29,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:29,747 INFO L87 Difference]: Start difference. First operand 192 states and 560 transitions. Second operand 8 states. [2020-02-10 20:13:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:29,805 INFO L93 Difference]: Finished difference Result 323 states and 804 transitions. [2020-02-10 20:13:29,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:29,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:29,806 INFO L225 Difference]: With dead ends: 323 [2020-02-10 20:13:29,806 INFO L226 Difference]: Without dead ends: 313 [2020-02-10 20:13:29,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-02-10 20:13:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 194. [2020-02-10 20:13:29,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-02-10 20:13:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 563 transitions. [2020-02-10 20:13:29,811 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 563 transitions. Word has length 19 [2020-02-10 20:13:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:29,811 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 563 transitions. [2020-02-10 20:13:29,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 563 transitions. [2020-02-10 20:13:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:29,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:29,812 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:29,812 INFO L427 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:29,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:29,812 INFO L82 PathProgramCache]: Analyzing trace with hash -490766164, now seen corresponding path program 282 times [2020-02-10 20:13:29,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:29,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241804098] [2020-02-10 20:13:29,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:30,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241804098] [2020-02-10 20:13:30,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:30,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:30,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811038994] [2020-02-10 20:13:30,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:30,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:30,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:30,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:30,008 INFO L87 Difference]: Start difference. First operand 194 states and 563 transitions. Second operand 8 states. [2020-02-10 20:13:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:30,086 INFO L93 Difference]: Finished difference Result 321 states and 799 transitions. [2020-02-10 20:13:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:30,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:30,087 INFO L225 Difference]: With dead ends: 321 [2020-02-10 20:13:30,087 INFO L226 Difference]: Without dead ends: 303 [2020-02-10 20:13:30,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:30,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-02-10 20:13:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 189. [2020-02-10 20:13:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 553 transitions. [2020-02-10 20:13:30,092 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 553 transitions. Word has length 19 [2020-02-10 20:13:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:30,092 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 553 transitions. [2020-02-10 20:13:30,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 553 transitions. [2020-02-10 20:13:30,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:30,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:30,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:30,093 INFO L427 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:30,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:30,093 INFO L82 PathProgramCache]: Analyzing trace with hash 504306274, now seen corresponding path program 283 times [2020-02-10 20:13:30,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:30,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588662697] [2020-02-10 20:13:30,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:30,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588662697] [2020-02-10 20:13:30,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:30,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:30,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303592997] [2020-02-10 20:13:30,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:30,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:30,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:30,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:30,282 INFO L87 Difference]: Start difference. First operand 189 states and 553 transitions. Second operand 8 states. [2020-02-10 20:13:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:30,361 INFO L93 Difference]: Finished difference Result 329 states and 825 transitions. [2020-02-10 20:13:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:30,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:30,362 INFO L225 Difference]: With dead ends: 329 [2020-02-10 20:13:30,363 INFO L226 Difference]: Without dead ends: 315 [2020-02-10 20:13:30,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-02-10 20:13:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 193. [2020-02-10 20:13:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 20:13:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 563 transitions. [2020-02-10 20:13:30,368 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 563 transitions. Word has length 19 [2020-02-10 20:13:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:30,368 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 563 transitions. [2020-02-10 20:13:30,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 563 transitions. [2020-02-10 20:13:30,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:30,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:30,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:30,369 INFO L427 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:30,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:30,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1624436104, now seen corresponding path program 284 times [2020-02-10 20:13:30,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:30,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807701021] [2020-02-10 20:13:30,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:30,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807701021] [2020-02-10 20:13:30,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:30,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:30,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248023372] [2020-02-10 20:13:30,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:30,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:30,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:30,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:30,571 INFO L87 Difference]: Start difference. First operand 193 states and 563 transitions. Second operand 8 states. [2020-02-10 20:13:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:30,637 INFO L93 Difference]: Finished difference Result 325 states and 814 transitions. [2020-02-10 20:13:30,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:30,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:30,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:30,638 INFO L225 Difference]: With dead ends: 325 [2020-02-10 20:13:30,638 INFO L226 Difference]: Without dead ends: 313 [2020-02-10 20:13:30,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-02-10 20:13:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 191. [2020-02-10 20:13:30,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:13:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 558 transitions. [2020-02-10 20:13:30,643 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 558 transitions. Word has length 19 [2020-02-10 20:13:30,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:30,644 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 558 transitions. [2020-02-10 20:13:30,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 558 transitions. [2020-02-10 20:13:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:30,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:30,644 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:30,644 INFO L427 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:30,644 INFO L82 PathProgramCache]: Analyzing trace with hash -568779106, now seen corresponding path program 285 times [2020-02-10 20:13:30,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:30,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138043541] [2020-02-10 20:13:30,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:30,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138043541] [2020-02-10 20:13:30,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:30,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:30,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690912524] [2020-02-10 20:13:30,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:30,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:30,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:30,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:30,881 INFO L87 Difference]: Start difference. First operand 191 states and 558 transitions. Second operand 8 states. [2020-02-10 20:13:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:30,969 INFO L93 Difference]: Finished difference Result 330 states and 825 transitions. [2020-02-10 20:13:30,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:30,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:30,970 INFO L225 Difference]: With dead ends: 330 [2020-02-10 20:13:30,971 INFO L226 Difference]: Without dead ends: 316 [2020-02-10 20:13:30,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-02-10 20:13:30,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 196. [2020-02-10 20:13:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-02-10 20:13:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 568 transitions. [2020-02-10 20:13:30,975 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 568 transitions. Word has length 19 [2020-02-10 20:13:30,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:30,975 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 568 transitions. [2020-02-10 20:13:30,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:30,975 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 568 transitions. [2020-02-10 20:13:30,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:30,975 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:30,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:30,976 INFO L427 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:30,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:30,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1210836024, now seen corresponding path program 286 times [2020-02-10 20:13:30,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:30,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412107614] [2020-02-10 20:13:30,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:31,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412107614] [2020-02-10 20:13:31,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:31,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:31,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442066310] [2020-02-10 20:13:31,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:31,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:31,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:31,173 INFO L87 Difference]: Start difference. First operand 196 states and 568 transitions. Second operand 8 states. [2020-02-10 20:13:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:31,261 INFO L93 Difference]: Finished difference Result 329 states and 818 transitions. [2020-02-10 20:13:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:31,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:31,263 INFO L225 Difference]: With dead ends: 329 [2020-02-10 20:13:31,263 INFO L226 Difference]: Without dead ends: 311 [2020-02-10 20:13:31,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-02-10 20:13:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 191. [2020-02-10 20:13:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:13:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-02-10 20:13:31,267 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-02-10 20:13:31,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:31,267 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-02-10 20:13:31,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-02-10 20:13:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:31,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:31,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:31,268 INFO L427 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:31,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:31,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1594820036, now seen corresponding path program 287 times [2020-02-10 20:13:31,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:31,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54768551] [2020-02-10 20:13:31,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:31,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54768551] [2020-02-10 20:13:31,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:31,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:31,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610896104] [2020-02-10 20:13:31,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:31,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:31,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:31,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:31,470 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-02-10 20:13:31,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:31,544 INFO L93 Difference]: Finished difference Result 319 states and 795 transitions. [2020-02-10 20:13:31,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:31,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:31,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:31,545 INFO L225 Difference]: With dead ends: 319 [2020-02-10 20:13:31,545 INFO L226 Difference]: Without dead ends: 309 [2020-02-10 20:13:31,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-02-10 20:13:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 193. [2020-02-10 20:13:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 20:13:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 559 transitions. [2020-02-10 20:13:31,549 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 559 transitions. Word has length 19 [2020-02-10 20:13:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:31,550 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 559 transitions. [2020-02-10 20:13:31,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 559 transitions. [2020-02-10 20:13:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:31,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:31,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:31,550 INFO L427 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:31,550 INFO L82 PathProgramCache]: Analyzing trace with hash -105415040, now seen corresponding path program 288 times [2020-02-10 20:13:31,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:31,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126926512] [2020-02-10 20:13:31,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:31,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126926512] [2020-02-10 20:13:31,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:31,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:31,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004971819] [2020-02-10 20:13:31,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:31,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:31,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:31,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:31,741 INFO L87 Difference]: Start difference. First operand 193 states and 559 transitions. Second operand 8 states. [2020-02-10 20:13:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:31,819 INFO L93 Difference]: Finished difference Result 317 states and 790 transitions. [2020-02-10 20:13:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:31,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:31,820 INFO L225 Difference]: With dead ends: 317 [2020-02-10 20:13:31,820 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:13:31,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:13:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-02-10 20:13:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:13:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 543 transitions. [2020-02-10 20:13:31,825 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 543 transitions. Word has length 19 [2020-02-10 20:13:31,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:31,825 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 543 transitions. [2020-02-10 20:13:31,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 543 transitions. [2020-02-10 20:13:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:31,826 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:31,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:31,826 INFO L427 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:31,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:31,826 INFO L82 PathProgramCache]: Analyzing trace with hash -907792650, now seen corresponding path program 289 times [2020-02-10 20:13:31,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:31,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240406772] [2020-02-10 20:13:31,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:32,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:13:32,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240406772] [2020-02-10 20:13:32,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:32,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:32,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763344482] [2020-02-10 20:13:32,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:32,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:32,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:32,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:32,030 INFO L87 Difference]: Start difference. First operand 184 states and 543 transitions. Second operand 8 states. [2020-02-10 20:13:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:32,090 INFO L93 Difference]: Finished difference Result 330 states and 816 transitions. [2020-02-10 20:13:32,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:32,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:32,091 INFO L225 Difference]: With dead ends: 330 [2020-02-10 20:13:32,092 INFO L226 Difference]: Without dead ends: 314 [2020-02-10 20:13:32,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-02-10 20:13:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 199. [2020-02-10 20:13:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-02-10 20:13:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 580 transitions. [2020-02-10 20:13:32,097 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 580 transitions. Word has length 19 [2020-02-10 20:13:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:32,097 INFO L479 AbstractCegarLoop]: Abstraction has 199 states and 580 transitions. [2020-02-10 20:13:32,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 580 transitions. [2020-02-10 20:13:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:32,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:32,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:32,098 INFO L427 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:32,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:32,098 INFO L82 PathProgramCache]: Analyzing trace with hash -533141464, now seen corresponding path program 290 times [2020-02-10 20:13:32,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:32,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989065803] [2020-02-10 20:13:32,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:32,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989065803] [2020-02-10 20:13:32,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:32,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:32,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444171718] [2020-02-10 20:13:32,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:32,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:32,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:32,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:32,299 INFO L87 Difference]: Start difference. First operand 199 states and 580 transitions. Second operand 8 states. [2020-02-10 20:13:32,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:32,388 INFO L93 Difference]: Finished difference Result 328 states and 806 transitions. [2020-02-10 20:13:32,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:32,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:32,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:32,390 INFO L225 Difference]: With dead ends: 328 [2020-02-10 20:13:32,390 INFO L226 Difference]: Without dead ends: 306 [2020-02-10 20:13:32,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:32,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-02-10 20:13:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 191. [2020-02-10 20:13:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:13:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 562 transitions. [2020-02-10 20:13:32,395 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 562 transitions. Word has length 19 [2020-02-10 20:13:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:32,396 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 562 transitions. [2020-02-10 20:13:32,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 562 transitions. [2020-02-10 20:13:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:32,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:32,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:32,397 INFO L427 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:32,397 INFO L82 PathProgramCache]: Analyzing trace with hash -703191568, now seen corresponding path program 291 times [2020-02-10 20:13:32,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:32,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407141537] [2020-02-10 20:13:32,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:32,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407141537] [2020-02-10 20:13:32,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:32,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:32,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616927485] [2020-02-10 20:13:32,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:32,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:32,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:32,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:32,600 INFO L87 Difference]: Start difference. First operand 191 states and 562 transitions. Second operand 8 states. [2020-02-10 20:13:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:32,671 INFO L93 Difference]: Finished difference Result 321 states and 789 transitions. [2020-02-10 20:13:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:32,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:32,673 INFO L225 Difference]: With dead ends: 321 [2020-02-10 20:13:32,673 INFO L226 Difference]: Without dead ends: 305 [2020-02-10 20:13:32,673 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-02-10 20:13:32,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 194. [2020-02-10 20:13:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-02-10 20:13:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 566 transitions. [2020-02-10 20:13:32,678 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 566 transitions. Word has length 19 [2020-02-10 20:13:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:32,678 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 566 transitions. [2020-02-10 20:13:32,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 566 transitions. [2020-02-10 20:13:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:32,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:32,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:32,678 INFO L427 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:32,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:32,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1440049182, now seen corresponding path program 292 times [2020-02-10 20:13:32,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:32,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005288193] [2020-02-10 20:13:32,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:32,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005288193] [2020-02-10 20:13:32,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:32,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:32,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077803426] [2020-02-10 20:13:32,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:32,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:32,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:32,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:32,863 INFO L87 Difference]: Start difference. First operand 194 states and 566 transitions. Second operand 8 states. [2020-02-10 20:13:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:32,956 INFO L93 Difference]: Finished difference Result 315 states and 774 transitions. [2020-02-10 20:13:32,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:32,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:32,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:32,957 INFO L225 Difference]: With dead ends: 315 [2020-02-10 20:13:32,957 INFO L226 Difference]: Without dead ends: 302 [2020-02-10 20:13:32,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-02-10 20:13:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 191. [2020-02-10 20:13:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:13:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 559 transitions. [2020-02-10 20:13:32,962 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 559 transitions. Word has length 19 [2020-02-10 20:13:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:32,962 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 559 transitions. [2020-02-10 20:13:32,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 559 transitions. [2020-02-10 20:13:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:32,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:32,963 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:32,963 INFO L427 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:32,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:32,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2101207602, now seen corresponding path program 293 times [2020-02-10 20:13:32,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:32,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886156970] [2020-02-10 20:13:32,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:33,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:33,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886156970] [2020-02-10 20:13:33,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:33,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:33,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733359430] [2020-02-10 20:13:33,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:33,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:33,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:33,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:33,154 INFO L87 Difference]: Start difference. First operand 191 states and 559 transitions. Second operand 8 states. [2020-02-10 20:13:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:33,230 INFO L93 Difference]: Finished difference Result 316 states and 778 transitions. [2020-02-10 20:13:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:33,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:33,231 INFO L225 Difference]: With dead ends: 316 [2020-02-10 20:13:33,231 INFO L226 Difference]: Without dead ends: 302 [2020-02-10 20:13:33,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-02-10 20:13:33,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 193. [2020-02-10 20:13:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 20:13:33,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 562 transitions. [2020-02-10 20:13:33,235 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 562 transitions. Word has length 19 [2020-02-10 20:13:33,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:33,235 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 562 transitions. [2020-02-10 20:13:33,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 562 transitions. [2020-02-10 20:13:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:33,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:33,236 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:33,236 INFO L427 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:33,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:33,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1319424368, now seen corresponding path program 294 times [2020-02-10 20:13:33,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:33,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377949001] [2020-02-10 20:13:33,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:33,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377949001] [2020-02-10 20:13:33,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:33,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:33,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012396725] [2020-02-10 20:13:33,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:33,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:33,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:33,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:33,428 INFO L87 Difference]: Start difference. First operand 193 states and 562 transitions. Second operand 8 states. [2020-02-10 20:13:33,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:33,510 INFO L93 Difference]: Finished difference Result 312 states and 767 transitions. [2020-02-10 20:13:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:33,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:33,511 INFO L225 Difference]: With dead ends: 312 [2020-02-10 20:13:33,511 INFO L226 Difference]: Without dead ends: 296 [2020-02-10 20:13:33,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:33,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-02-10 20:13:33,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 187. [2020-02-10 20:13:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:13:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 551 transitions. [2020-02-10 20:13:33,516 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 551 transitions. Word has length 19 [2020-02-10 20:13:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:33,517 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 551 transitions. [2020-02-10 20:13:33,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 551 transitions. [2020-02-10 20:13:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:33,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:33,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:33,517 INFO L427 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:33,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:33,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1330278376, now seen corresponding path program 295 times [2020-02-10 20:13:33,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:33,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051238552] [2020-02-10 20:13:33,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:33,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051238552] [2020-02-10 20:13:33,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:33,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:33,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47693368] [2020-02-10 20:13:33,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:33,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:33,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:33,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:33,755 INFO L87 Difference]: Start difference. First operand 187 states and 551 transitions. Second operand 8 states. [2020-02-10 20:13:33,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:33,813 INFO L93 Difference]: Finished difference Result 318 states and 780 transitions. [2020-02-10 20:13:33,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:33,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:33,814 INFO L225 Difference]: With dead ends: 318 [2020-02-10 20:13:33,814 INFO L226 Difference]: Without dead ends: 302 [2020-02-10 20:13:33,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:33,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-02-10 20:13:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 199. [2020-02-10 20:13:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-02-10 20:13:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 577 transitions. [2020-02-10 20:13:33,819 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 577 transitions. Word has length 19 [2020-02-10 20:13:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:33,819 INFO L479 AbstractCegarLoop]: Abstraction has 199 states and 577 transitions. [2020-02-10 20:13:33,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 577 transitions. [2020-02-10 20:13:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:33,819 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:33,820 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:33,820 INFO L427 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash -955627190, now seen corresponding path program 296 times [2020-02-10 20:13:33,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:33,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963679164] [2020-02-10 20:13:33,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:34,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963679164] [2020-02-10 20:13:34,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:34,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:34,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233117205] [2020-02-10 20:13:34,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:34,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:34,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:34,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:34,020 INFO L87 Difference]: Start difference. First operand 199 states and 577 transitions. Second operand 8 states. [2020-02-10 20:13:34,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:34,098 INFO L93 Difference]: Finished difference Result 316 states and 770 transitions. [2020-02-10 20:13:34,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:34,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:34,099 INFO L225 Difference]: With dead ends: 316 [2020-02-10 20:13:34,099 INFO L226 Difference]: Without dead ends: 294 [2020-02-10 20:13:34,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-02-10 20:13:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 191. [2020-02-10 20:13:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:13:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 559 transitions. [2020-02-10 20:13:34,104 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 559 transitions. Word has length 19 [2020-02-10 20:13:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:34,104 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 559 transitions. [2020-02-10 20:13:34,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 559 transitions. [2020-02-10 20:13:34,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:34,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:34,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:34,105 INFO L427 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:34,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:34,105 INFO L82 PathProgramCache]: Analyzing trace with hash -800081070, now seen corresponding path program 297 times [2020-02-10 20:13:34,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:34,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328371323] [2020-02-10 20:13:34,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:34,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:13:34,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328371323] [2020-02-10 20:13:34,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:34,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:34,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440740613] [2020-02-10 20:13:34,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:34,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:34,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:34,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:34,327 INFO L87 Difference]: Start difference. First operand 191 states and 559 transitions. Second operand 8 states. [2020-02-10 20:13:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:34,399 INFO L93 Difference]: Finished difference Result 301 states and 738 transitions. [2020-02-10 20:13:34,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:34,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:34,401 INFO L225 Difference]: With dead ends: 301 [2020-02-10 20:13:34,401 INFO L226 Difference]: Without dead ends: 285 [2020-02-10 20:13:34,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-02-10 20:13:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 194. [2020-02-10 20:13:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-02-10 20:13:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 563 transitions. [2020-02-10 20:13:34,407 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 563 transitions. Word has length 19 [2020-02-10 20:13:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:34,408 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 563 transitions. [2020-02-10 20:13:34,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 563 transitions. [2020-02-10 20:13:34,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:34,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:34,408 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:34,408 INFO L427 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash -541022844, now seen corresponding path program 298 times [2020-02-10 20:13:34,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:34,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782225597] [2020-02-10 20:13:34,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:34,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782225597] [2020-02-10 20:13:34,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:34,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:34,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399808501] [2020-02-10 20:13:34,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:34,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:34,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:34,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:34,616 INFO L87 Difference]: Start difference. First operand 194 states and 563 transitions. Second operand 8 states. [2020-02-10 20:13:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:34,677 INFO L93 Difference]: Finished difference Result 286 states and 714 transitions. [2020-02-10 20:13:34,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:34,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:34,678 INFO L225 Difference]: With dead ends: 286 [2020-02-10 20:13:34,678 INFO L226 Difference]: Without dead ends: 273 [2020-02-10 20:13:34,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-02-10 20:13:34,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 191. [2020-02-10 20:13:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:13:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-02-10 20:13:34,683 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-02-10 20:13:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:34,683 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-02-10 20:13:34,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-02-10 20:13:34,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:34,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:34,683 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:34,684 INFO L427 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:34,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:34,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1122224650, now seen corresponding path program 299 times [2020-02-10 20:13:34,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:34,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177507012] [2020-02-10 20:13:34,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:34,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177507012] [2020-02-10 20:13:34,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:34,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:34,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154232566] [2020-02-10 20:13:34,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:34,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:34,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:34,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:34,877 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-02-10 20:13:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:34,959 INFO L93 Difference]: Finished difference Result 298 states and 730 transitions. [2020-02-10 20:13:34,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:34,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:34,961 INFO L225 Difference]: With dead ends: 298 [2020-02-10 20:13:34,961 INFO L226 Difference]: Without dead ends: 284 [2020-02-10 20:13:34,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-02-10 20:13:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 193. [2020-02-10 20:13:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 20:13:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 559 transitions. [2020-02-10 20:13:34,966 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 559 transitions. Word has length 19 [2020-02-10 20:13:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:34,966 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 559 transitions. [2020-02-10 20:13:34,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 559 transitions. [2020-02-10 20:13:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:34,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:34,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:34,967 INFO L427 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:34,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:34,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2052612816, now seen corresponding path program 300 times [2020-02-10 20:13:34,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:34,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19947995] [2020-02-10 20:13:34,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:35,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19947995] [2020-02-10 20:13:35,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:35,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:35,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780473941] [2020-02-10 20:13:35,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:35,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:35,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:35,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:35,168 INFO L87 Difference]: Start difference. First operand 193 states and 559 transitions. Second operand 8 states. [2020-02-10 20:13:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:35,235 INFO L93 Difference]: Finished difference Result 285 states and 710 transitions. [2020-02-10 20:13:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:35,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:35,236 INFO L225 Difference]: With dead ends: 285 [2020-02-10 20:13:35,236 INFO L226 Difference]: Without dead ends: 269 [2020-02-10 20:13:35,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-02-10 20:13:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 187. [2020-02-10 20:13:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:13:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 548 transitions. [2020-02-10 20:13:35,242 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 548 transitions. Word has length 19 [2020-02-10 20:13:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:35,242 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 548 transitions. [2020-02-10 20:13:35,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 548 transitions. [2020-02-10 20:13:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:35,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:35,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:35,243 INFO L427 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:35,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:35,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1446944266, now seen corresponding path program 301 times [2020-02-10 20:13:35,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:35,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231703211] [2020-02-10 20:13:35,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:35,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231703211] [2020-02-10 20:13:35,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:35,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:35,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790558992] [2020-02-10 20:13:35,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:35,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:35,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:35,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:35,430 INFO L87 Difference]: Start difference. First operand 187 states and 548 transitions. Second operand 8 states. [2020-02-10 20:13:35,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:35,522 INFO L93 Difference]: Finished difference Result 294 states and 721 transitions. [2020-02-10 20:13:35,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:35,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:35,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:35,523 INFO L225 Difference]: With dead ends: 294 [2020-02-10 20:13:35,523 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 20:13:35,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:35,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 20:13:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 192. [2020-02-10 20:13:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:13:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 558 transitions. [2020-02-10 20:13:35,528 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 558 transitions. Word has length 19 [2020-02-10 20:13:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:35,529 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 558 transitions. [2020-02-10 20:13:35,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 558 transitions. [2020-02-10 20:13:35,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:35,529 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:35,529 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:35,529 INFO L427 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:35,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:35,529 INFO L82 PathProgramCache]: Analyzing trace with hash 696296484, now seen corresponding path program 302 times [2020-02-10 20:13:35,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:35,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145315058] [2020-02-10 20:13:35,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:35,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145315058] [2020-02-10 20:13:35,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:35,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:35,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120632210] [2020-02-10 20:13:35,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:35,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:35,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:35,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:35,714 INFO L87 Difference]: Start difference. First operand 192 states and 558 transitions. Second operand 8 states. [2020-02-10 20:13:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:35,805 INFO L93 Difference]: Finished difference Result 288 states and 706 transitions. [2020-02-10 20:13:35,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:35,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:35,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:35,807 INFO L225 Difference]: With dead ends: 288 [2020-02-10 20:13:35,807 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 20:13:35,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 20:13:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 189. [2020-02-10 20:13:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 552 transitions. [2020-02-10 20:13:35,812 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 552 transitions. Word has length 19 [2020-02-10 20:13:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:35,812 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 552 transitions. [2020-02-10 20:13:35,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:35,812 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 552 transitions. [2020-02-10 20:13:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:35,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:35,813 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:35,813 INFO L427 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:35,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:35,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1247585176, now seen corresponding path program 303 times [2020-02-10 20:13:35,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:35,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705956143] [2020-02-10 20:13:35,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:36,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:13:36,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705956143] [2020-02-10 20:13:36,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:36,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:36,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406192534] [2020-02-10 20:13:36,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:36,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:36,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:36,027 INFO L87 Difference]: Start difference. First operand 189 states and 552 transitions. Second operand 8 states. [2020-02-10 20:13:36,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:36,102 INFO L93 Difference]: Finished difference Result 283 states and 697 transitions. [2020-02-10 20:13:36,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:36,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:36,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:36,103 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:13:36,103 INFO L226 Difference]: Without dead ends: 267 [2020-02-10 20:13:36,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:36,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-02-10 20:13:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 192. [2020-02-10 20:13:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:13:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-02-10 20:13:36,108 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-02-10 20:13:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:36,108 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-02-10 20:13:36,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-02-10 20:13:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:36,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:36,109 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:36,109 INFO L427 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:36,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:36,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1506643402, now seen corresponding path program 304 times [2020-02-10 20:13:36,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:36,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012656501] [2020-02-10 20:13:36,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:36,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012656501] [2020-02-10 20:13:36,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:36,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:36,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476861893] [2020-02-10 20:13:36,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:36,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:36,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:36,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:36,306 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-02-10 20:13:36,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:36,365 INFO L93 Difference]: Finished difference Result 268 states and 673 transitions. [2020-02-10 20:13:36,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:36,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:36,366 INFO L225 Difference]: With dead ends: 268 [2020-02-10 20:13:36,367 INFO L226 Difference]: Without dead ends: 255 [2020-02-10 20:13:36,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-02-10 20:13:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 189. [2020-02-10 20:13:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-02-10 20:13:36,372 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-02-10 20:13:36,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:36,372 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-02-10 20:13:36,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-02-10 20:13:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:36,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:36,373 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:36,373 INFO L427 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:36,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:36,373 INFO L82 PathProgramCache]: Analyzing trace with hash 266205080, now seen corresponding path program 305 times [2020-02-10 20:13:36,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:36,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342297016] [2020-02-10 20:13:36,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:36,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342297016] [2020-02-10 20:13:36,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:36,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:36,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801773553] [2020-02-10 20:13:36,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:36,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:36,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:36,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:36,578 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-02-10 20:13:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:36,659 INFO L93 Difference]: Finished difference Result 266 states and 669 transitions. [2020-02-10 20:13:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:36,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:36,660 INFO L225 Difference]: With dead ends: 266 [2020-02-10 20:13:36,660 INFO L226 Difference]: Without dead ends: 256 [2020-02-10 20:13:36,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:36,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-02-10 20:13:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 190. [2020-02-10 20:13:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-02-10 20:13:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 551 transitions. [2020-02-10 20:13:36,666 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 551 transitions. Word has length 19 [2020-02-10 20:13:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:36,666 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 551 transitions. [2020-02-10 20:13:36,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 551 transitions. [2020-02-10 20:13:36,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:36,666 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:36,667 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:36,667 INFO L427 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:36,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:36,667 INFO L82 PathProgramCache]: Analyzing trace with hash 26562742, now seen corresponding path program 306 times [2020-02-10 20:13:36,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:36,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495247621] [2020-02-10 20:13:36,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:36,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:13:36,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495247621] [2020-02-10 20:13:36,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:36,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:36,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603868665] [2020-02-10 20:13:36,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:36,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:36,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:36,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:36,899 INFO L87 Difference]: Start difference. First operand 190 states and 551 transitions. Second operand 8 states. [2020-02-10 20:13:36,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:36,954 INFO L93 Difference]: Finished difference Result 255 states and 656 transitions. [2020-02-10 20:13:36,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:36,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:36,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:36,955 INFO L225 Difference]: With dead ends: 255 [2020-02-10 20:13:36,955 INFO L226 Difference]: Without dead ends: 242 [2020-02-10 20:13:36,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-02-10 20:13:36,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 187. [2020-02-10 20:13:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:13:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 546 transitions. [2020-02-10 20:13:36,960 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 546 transitions. Word has length 19 [2020-02-10 20:13:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:36,960 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 546 transitions. [2020-02-10 20:13:36,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 546 transitions. [2020-02-10 20:13:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:36,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:36,960 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:36,961 INFO L427 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:36,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:36,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1887873640, now seen corresponding path program 307 times [2020-02-10 20:13:36,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:36,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223836791] [2020-02-10 20:13:36,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:37,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223836791] [2020-02-10 20:13:37,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:37,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:37,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35402016] [2020-02-10 20:13:37,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:37,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:37,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:37,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:37,145 INFO L87 Difference]: Start difference. First operand 187 states and 546 transitions. Second operand 8 states. [2020-02-10 20:13:37,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:37,223 INFO L93 Difference]: Finished difference Result 287 states and 706 transitions. [2020-02-10 20:13:37,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:37,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:37,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:37,224 INFO L225 Difference]: With dead ends: 287 [2020-02-10 20:13:37,224 INFO L226 Difference]: Without dead ends: 273 [2020-02-10 20:13:37,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:37,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-02-10 20:13:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 190. [2020-02-10 20:13:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-02-10 20:13:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 552 transitions. [2020-02-10 20:13:37,228 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 552 transitions. Word has length 19 [2020-02-10 20:13:37,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:37,228 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 552 transitions. [2020-02-10 20:13:37,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:37,228 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 552 transitions. [2020-02-10 20:13:37,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:37,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:37,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:37,229 INFO L427 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:37,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:37,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1013538314, now seen corresponding path program 308 times [2020-02-10 20:13:37,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:37,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17940371] [2020-02-10 20:13:37,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:37,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:13:37,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17940371] [2020-02-10 20:13:37,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:37,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:37,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865214088] [2020-02-10 20:13:37,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:37,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:37,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:37,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:37,422 INFO L87 Difference]: Start difference. First operand 190 states and 552 transitions. Second operand 8 states. [2020-02-10 20:13:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:37,505 INFO L93 Difference]: Finished difference Result 283 states and 695 transitions. [2020-02-10 20:13:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:37,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:37,506 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:13:37,506 INFO L226 Difference]: Without dead ends: 271 [2020-02-10 20:13:37,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:37,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-02-10 20:13:37,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 188. [2020-02-10 20:13:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:13:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 548 transitions. [2020-02-10 20:13:37,510 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 548 transitions. Word has length 19 [2020-02-10 20:13:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:37,510 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 548 transitions. [2020-02-10 20:13:37,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 548 transitions. [2020-02-10 20:13:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:37,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:37,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:37,511 INFO L427 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:37,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:37,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1246071542, now seen corresponding path program 309 times [2020-02-10 20:13:37,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:37,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979190740] [2020-02-10 20:13:37,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:37,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979190740] [2020-02-10 20:13:37,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:37,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:37,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186491866] [2020-02-10 20:13:37,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:37,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:37,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:37,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:37,702 INFO L87 Difference]: Start difference. First operand 188 states and 548 transitions. Second operand 8 states. [2020-02-10 20:13:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:37,777 INFO L93 Difference]: Finished difference Result 279 states and 688 transitions. [2020-02-10 20:13:37,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:37,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:37,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:37,778 INFO L225 Difference]: With dead ends: 279 [2020-02-10 20:13:37,778 INFO L226 Difference]: Without dead ends: 265 [2020-02-10 20:13:37,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:37,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-02-10 20:13:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 190. [2020-02-10 20:13:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-02-10 20:13:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 551 transitions. [2020-02-10 20:13:37,783 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 551 transitions. Word has length 19 [2020-02-10 20:13:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:37,783 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 551 transitions. [2020-02-10 20:13:37,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 551 transitions. [2020-02-10 20:13:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:37,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:37,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:37,784 INFO L427 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:37,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:37,784 INFO L82 PathProgramCache]: Analyzing trace with hash -125941712, now seen corresponding path program 310 times [2020-02-10 20:13:37,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:37,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329010964] [2020-02-10 20:13:37,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:37,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329010964] [2020-02-10 20:13:37,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:37,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:37,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185367191] [2020-02-10 20:13:37,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:37,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:37,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:37,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:37,979 INFO L87 Difference]: Start difference. First operand 190 states and 551 transitions. Second operand 8 states. [2020-02-10 20:13:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:38,037 INFO L93 Difference]: Finished difference Result 266 states and 668 transitions. [2020-02-10 20:13:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:38,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:38,038 INFO L225 Difference]: With dead ends: 266 [2020-02-10 20:13:38,038 INFO L226 Difference]: Without dead ends: 254 [2020-02-10 20:13:38,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-02-10 20:13:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 188. [2020-02-10 20:13:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:13:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 547 transitions. [2020-02-10 20:13:38,043 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 547 transitions. Word has length 19 [2020-02-10 20:13:38,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:38,043 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 547 transitions. [2020-02-10 20:13:38,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 547 transitions. [2020-02-10 20:13:38,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:38,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:38,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:38,044 INFO L427 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:38,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:38,044 INFO L82 PathProgramCache]: Analyzing trace with hash 651556204, now seen corresponding path program 311 times [2020-02-10 20:13:38,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:38,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851786817] [2020-02-10 20:13:38,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:38,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851786817] [2020-02-10 20:13:38,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:38,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:38,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682995331] [2020-02-10 20:13:38,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:38,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:38,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:38,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:38,246 INFO L87 Difference]: Start difference. First operand 188 states and 547 transitions. Second operand 8 states. [2020-02-10 20:13:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:38,331 INFO L93 Difference]: Finished difference Result 265 states and 666 transitions. [2020-02-10 20:13:38,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:38,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:38,332 INFO L225 Difference]: With dead ends: 265 [2020-02-10 20:13:38,332 INFO L226 Difference]: Without dead ends: 255 [2020-02-10 20:13:38,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:38,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-02-10 20:13:38,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 189. [2020-02-10 20:13:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 548 transitions. [2020-02-10 20:13:38,336 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 548 transitions. Word has length 19 [2020-02-10 20:13:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:38,336 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 548 transitions. [2020-02-10 20:13:38,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 548 transitions. [2020-02-10 20:13:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:38,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:38,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:38,337 INFO L427 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:38,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:38,337 INFO L82 PathProgramCache]: Analyzing trace with hash 411913866, now seen corresponding path program 312 times [2020-02-10 20:13:38,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:38,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864245499] [2020-02-10 20:13:38,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:38,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864245499] [2020-02-10 20:13:38,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:38,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:38,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074979393] [2020-02-10 20:13:38,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:38,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:38,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:38,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:38,550 INFO L87 Difference]: Start difference. First operand 189 states and 548 transitions. Second operand 8 states. [2020-02-10 20:13:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:38,622 INFO L93 Difference]: Finished difference Result 254 states and 653 transitions. [2020-02-10 20:13:38,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:38,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:38,623 INFO L225 Difference]: With dead ends: 254 [2020-02-10 20:13:38,623 INFO L226 Difference]: Without dead ends: 239 [2020-02-10 20:13:38,623 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-02-10 20:13:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 184. [2020-02-10 20:13:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:13:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 540 transitions. [2020-02-10 20:13:38,627 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 540 transitions. Word has length 19 [2020-02-10 20:13:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:38,627 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 540 transitions. [2020-02-10 20:13:38,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 540 transitions. [2020-02-10 20:13:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:38,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:38,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:38,628 INFO L427 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:38,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:38,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2756816, now seen corresponding path program 313 times [2020-02-10 20:13:38,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:38,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008492426] [2020-02-10 20:13:38,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:38,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:13:38,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008492426] [2020-02-10 20:13:38,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:38,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:38,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213330099] [2020-02-10 20:13:38,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:38,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:38,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:38,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:38,818 INFO L87 Difference]: Start difference. First operand 184 states and 540 transitions. Second operand 8 states. [2020-02-10 20:13:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:38,880 INFO L93 Difference]: Finished difference Result 315 states and 778 transitions. [2020-02-10 20:13:38,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:38,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:38,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:38,881 INFO L225 Difference]: With dead ends: 315 [2020-02-10 20:13:38,881 INFO L226 Difference]: Without dead ends: 299 [2020-02-10 20:13:38,881 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:38,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-02-10 20:13:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 191. [2020-02-10 20:13:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:13:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 558 transitions. [2020-02-10 20:13:38,886 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 558 transitions. Word has length 19 [2020-02-10 20:13:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:38,886 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 558 transitions. [2020-02-10 20:13:38,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 558 transitions. [2020-02-10 20:13:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:38,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:38,887 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:38,887 INFO L427 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:38,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:38,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2140483934, now seen corresponding path program 314 times [2020-02-10 20:13:38,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:38,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595505904] [2020-02-10 20:13:38,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:39,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:13:39,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595505904] [2020-02-10 20:13:39,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:39,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:39,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228054214] [2020-02-10 20:13:39,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:39,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:39,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:39,080 INFO L87 Difference]: Start difference. First operand 191 states and 558 transitions. Second operand 8 states. [2020-02-10 20:13:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:39,169 INFO L93 Difference]: Finished difference Result 309 states and 763 transitions. [2020-02-10 20:13:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:39,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:39,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:39,170 INFO L225 Difference]: With dead ends: 309 [2020-02-10 20:13:39,170 INFO L226 Difference]: Without dead ends: 296 [2020-02-10 20:13:39,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-02-10 20:13:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2020-02-10 20:13:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:13:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 552 transitions. [2020-02-10 20:13:39,175 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 552 transitions. Word has length 19 [2020-02-10 20:13:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:39,175 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 552 transitions. [2020-02-10 20:13:39,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 552 transitions. [2020-02-10 20:13:39,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:39,176 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:39,176 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:39,176 INFO L427 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:39,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:39,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1603194670, now seen corresponding path program 315 times [2020-02-10 20:13:39,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:39,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670329660] [2020-02-10 20:13:39,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:39,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670329660] [2020-02-10 20:13:39,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:39,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:39,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208119931] [2020-02-10 20:13:39,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:39,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:39,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:39,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:39,372 INFO L87 Difference]: Start difference. First operand 188 states and 552 transitions. Second operand 8 states. [2020-02-10 20:13:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:39,433 INFO L93 Difference]: Finished difference Result 315 states and 776 transitions. [2020-02-10 20:13:39,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:39,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:39,434 INFO L225 Difference]: With dead ends: 315 [2020-02-10 20:13:39,434 INFO L226 Difference]: Without dead ends: 299 [2020-02-10 20:13:39,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-02-10 20:13:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 191. [2020-02-10 20:13:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:13:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-02-10 20:13:39,439 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-02-10 20:13:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:39,439 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-02-10 20:13:39,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-02-10 20:13:39,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:39,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:39,439 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:39,439 INFO L427 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:39,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:39,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1344136444, now seen corresponding path program 316 times [2020-02-10 20:13:39,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:39,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507850565] [2020-02-10 20:13:39,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:39,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507850565] [2020-02-10 20:13:39,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:39,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:39,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47104256] [2020-02-10 20:13:39,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:39,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:39,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:39,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:39,638 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-02-10 20:13:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:39,710 INFO L93 Difference]: Finished difference Result 309 states and 761 transitions. [2020-02-10 20:13:39,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:39,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:39,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:39,712 INFO L225 Difference]: With dead ends: 309 [2020-02-10 20:13:39,712 INFO L226 Difference]: Without dead ends: 296 [2020-02-10 20:13:39,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-02-10 20:13:39,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2020-02-10 20:13:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:13:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 550 transitions. [2020-02-10 20:13:39,717 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 550 transitions. Word has length 19 [2020-02-10 20:13:39,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:39,717 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 550 transitions. [2020-02-10 20:13:39,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 550 transitions. [2020-02-10 20:13:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:39,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:39,717 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:39,717 INFO L427 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:39,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:39,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1710392530, now seen corresponding path program 317 times [2020-02-10 20:13:39,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:39,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690939652] [2020-02-10 20:13:39,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:39,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690939652] [2020-02-10 20:13:39,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:39,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:39,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862431877] [2020-02-10 20:13:39,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:39,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:39,915 INFO L87 Difference]: Start difference. First operand 188 states and 550 transitions. Second operand 8 states. [2020-02-10 20:13:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:40,007 INFO L93 Difference]: Finished difference Result 301 states and 745 transitions. [2020-02-10 20:13:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:40,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:40,009 INFO L225 Difference]: With dead ends: 301 [2020-02-10 20:13:40,009 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 20:13:40,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 20:13:40,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 189. [2020-02-10 20:13:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-02-10 20:13:40,014 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-02-10 20:13:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:40,015 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-02-10 20:13:40,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-02-10 20:13:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:40,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:40,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:40,016 INFO L427 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:40,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:40,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1470750192, now seen corresponding path program 318 times [2020-02-10 20:13:40,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:40,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500288143] [2020-02-10 20:13:40,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:40,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500288143] [2020-02-10 20:13:40,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:40,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:40,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648987675] [2020-02-10 20:13:40,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:40,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:40,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:40,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:40,222 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-02-10 20:13:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:40,291 INFO L93 Difference]: Finished difference Result 301 states and 744 transitions. [2020-02-10 20:13:40,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:40,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:40,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:40,292 INFO L225 Difference]: With dead ends: 301 [2020-02-10 20:13:40,292 INFO L226 Difference]: Without dead ends: 288 [2020-02-10 20:13:40,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:40,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-02-10 20:13:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 186. [2020-02-10 20:13:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:13:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 546 transitions. [2020-02-10 20:13:40,297 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 546 transitions. Word has length 19 [2020-02-10 20:13:40,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:40,298 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 546 transitions. [2020-02-10 20:13:40,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:40,298 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 546 transitions. [2020-02-10 20:13:40,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:40,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:40,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:40,299 INFO L427 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:40,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:40,299 INFO L82 PathProgramCache]: Analyzing trace with hash -445655956, now seen corresponding path program 319 times [2020-02-10 20:13:40,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:40,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135194933] [2020-02-10 20:13:40,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:40,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:13:40,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135194933] [2020-02-10 20:13:40,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:40,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:40,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363135728] [2020-02-10 20:13:40,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:40,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:40,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:40,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:40,487 INFO L87 Difference]: Start difference. First operand 186 states and 546 transitions. Second operand 8 states. [2020-02-10 20:13:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:40,548 INFO L93 Difference]: Finished difference Result 314 states and 773 transitions. [2020-02-10 20:13:40,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:40,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:40,549 INFO L225 Difference]: With dead ends: 314 [2020-02-10 20:13:40,550 INFO L226 Difference]: Without dead ends: 298 [2020-02-10 20:13:40,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-02-10 20:13:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 192. [2020-02-10 20:13:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:13:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 560 transitions. [2020-02-10 20:13:40,555 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 560 transitions. Word has length 19 [2020-02-10 20:13:40,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:40,555 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 560 transitions. [2020-02-10 20:13:40,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 560 transitions. [2020-02-10 20:13:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:40,555 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:40,555 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:40,555 INFO L427 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:40,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:40,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1697584794, now seen corresponding path program 320 times [2020-02-10 20:13:40,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:40,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115859822] [2020-02-10 20:13:40,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:40,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115859822] [2020-02-10 20:13:40,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:40,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:40,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448245832] [2020-02-10 20:13:40,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:40,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:40,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:40,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:40,732 INFO L87 Difference]: Start difference. First operand 192 states and 560 transitions. Second operand 8 states. [2020-02-10 20:13:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:40,825 INFO L93 Difference]: Finished difference Result 308 states and 758 transitions. [2020-02-10 20:13:40,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:40,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:40,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:40,827 INFO L225 Difference]: With dead ends: 308 [2020-02-10 20:13:40,827 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:13:40,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:13:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 189. [2020-02-10 20:13:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 553 transitions. [2020-02-10 20:13:40,831 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 553 transitions. Word has length 19 [2020-02-10 20:13:40,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:40,831 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 553 transitions. [2020-02-10 20:13:40,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 553 transitions. [2020-02-10 20:13:40,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:40,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:40,832 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:40,832 INFO L427 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:40,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:40,832 INFO L82 PathProgramCache]: Analyzing trace with hash -952002222, now seen corresponding path program 321 times [2020-02-10 20:13:40,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:40,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797822655] [2020-02-10 20:13:40,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:41,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797822655] [2020-02-10 20:13:41,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:41,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:41,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921032151] [2020-02-10 20:13:41,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:41,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:41,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:41,018 INFO L87 Difference]: Start difference. First operand 189 states and 553 transitions. Second operand 8 states. [2020-02-10 20:13:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:41,093 INFO L93 Difference]: Finished difference Result 320 states and 787 transitions. [2020-02-10 20:13:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:41,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:41,094 INFO L225 Difference]: With dead ends: 320 [2020-02-10 20:13:41,094 INFO L226 Difference]: Without dead ends: 304 [2020-02-10 20:13:41,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-02-10 20:13:41,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 195. [2020-02-10 20:13:41,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-02-10 20:13:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 564 transitions. [2020-02-10 20:13:41,099 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 564 transitions. Word has length 19 [2020-02-10 20:13:41,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:41,099 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 564 transitions. [2020-02-10 20:13:41,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:41,099 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 564 transitions. [2020-02-10 20:13:41,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:41,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:41,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:41,100 INFO L427 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:41,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:41,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1928206972, now seen corresponding path program 322 times [2020-02-10 20:13:41,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:41,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87562788] [2020-02-10 20:13:41,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:41,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87562788] [2020-02-10 20:13:41,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:41,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:41,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693418966] [2020-02-10 20:13:41,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:41,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:41,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:41,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:41,278 INFO L87 Difference]: Start difference. First operand 195 states and 564 transitions. Second operand 8 states. [2020-02-10 20:13:41,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:41,374 INFO L93 Difference]: Finished difference Result 317 states and 776 transitions. [2020-02-10 20:13:41,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:41,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:41,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:41,375 INFO L225 Difference]: With dead ends: 317 [2020-02-10 20:13:41,375 INFO L226 Difference]: Without dead ends: 298 [2020-02-10 20:13:41,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-02-10 20:13:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 189. [2020-02-10 20:13:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-02-10 20:13:41,380 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-02-10 20:13:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:41,380 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-02-10 20:13:41,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-02-10 20:13:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:41,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:41,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:41,381 INFO L427 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:41,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:41,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1813226296, now seen corresponding path program 323 times [2020-02-10 20:13:41,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:41,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134750340] [2020-02-10 20:13:41,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:41,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134750340] [2020-02-10 20:13:41,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:41,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:41,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479086722] [2020-02-10 20:13:41,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:41,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:41,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:41,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:41,558 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-02-10 20:13:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:41,641 INFO L93 Difference]: Finished difference Result 304 states and 748 transitions. [2020-02-10 20:13:41,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:41,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:41,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:41,643 INFO L225 Difference]: With dead ends: 304 [2020-02-10 20:13:41,643 INFO L226 Difference]: Without dead ends: 294 [2020-02-10 20:13:41,643 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-02-10 20:13:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 191. [2020-02-10 20:13:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:13:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 553 transitions. [2020-02-10 20:13:41,647 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 553 transitions. Word has length 19 [2020-02-10 20:13:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:41,647 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 553 transitions. [2020-02-10 20:13:41,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 553 transitions. [2020-02-10 20:13:41,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:41,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:41,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:41,648 INFO L427 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:41,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:41,648 INFO L82 PathProgramCache]: Analyzing trace with hash 84178962, now seen corresponding path program 324 times [2020-02-10 20:13:41,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:41,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960634016] [2020-02-10 20:13:41,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:41,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960634016] [2020-02-10 20:13:41,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:41,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:41,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338232812] [2020-02-10 20:13:41,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:41,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:41,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:41,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:41,828 INFO L87 Difference]: Start difference. First operand 191 states and 553 transitions. Second operand 8 states. [2020-02-10 20:13:41,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:41,916 INFO L93 Difference]: Finished difference Result 307 states and 753 transitions. [2020-02-10 20:13:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:41,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:41,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:41,917 INFO L225 Difference]: With dead ends: 307 [2020-02-10 20:13:41,917 INFO L226 Difference]: Without dead ends: 289 [2020-02-10 20:13:41,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-02-10 20:13:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 186. [2020-02-10 20:13:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:13:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 544 transitions. [2020-02-10 20:13:41,922 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 544 transitions. Word has length 19 [2020-02-10 20:13:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:41,922 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 544 transitions. [2020-02-10 20:13:41,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 544 transitions. [2020-02-10 20:13:41,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:41,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:41,922 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:41,922 INFO L427 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:41,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:41,923 INFO L82 PathProgramCache]: Analyzing trace with hash -120059732, now seen corresponding path program 325 times [2020-02-10 20:13:41,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:41,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007825263] [2020-02-10 20:13:41,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:42,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007825263] [2020-02-10 20:13:42,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:42,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:42,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450356680] [2020-02-10 20:13:42,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:42,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:42,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:42,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:42,116 INFO L87 Difference]: Start difference. First operand 186 states and 544 transitions. Second operand 8 states. [2020-02-10 20:13:42,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:42,186 INFO L93 Difference]: Finished difference Result 311 states and 761 transitions. [2020-02-10 20:13:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:42,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:42,187 INFO L225 Difference]: With dead ends: 311 [2020-02-10 20:13:42,187 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:13:42,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:42,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:13:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 192. [2020-02-10 20:13:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:13:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 558 transitions. [2020-02-10 20:13:42,191 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 558 transitions. Word has length 19 [2020-02-10 20:13:42,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:42,191 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 558 transitions. [2020-02-10 20:13:42,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:42,191 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 558 transitions. [2020-02-10 20:13:42,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:42,192 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:42,192 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:42,192 INFO L427 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:42,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:42,192 INFO L82 PathProgramCache]: Analyzing trace with hash 138998494, now seen corresponding path program 326 times [2020-02-10 20:13:42,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:42,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662743985] [2020-02-10 20:13:42,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:42,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662743985] [2020-02-10 20:13:42,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:42,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:42,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881916904] [2020-02-10 20:13:42,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:42,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:42,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:42,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:42,393 INFO L87 Difference]: Start difference. First operand 192 states and 558 transitions. Second operand 8 states. [2020-02-10 20:13:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:42,462 INFO L93 Difference]: Finished difference Result 305 states and 746 transitions. [2020-02-10 20:13:42,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:42,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:42,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:42,463 INFO L225 Difference]: With dead ends: 305 [2020-02-10 20:13:42,463 INFO L226 Difference]: Without dead ends: 292 [2020-02-10 20:13:42,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-02-10 20:13:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 189. [2020-02-10 20:13:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-02-10 20:13:42,468 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-02-10 20:13:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:42,468 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-02-10 20:13:42,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-02-10 20:13:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:42,468 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:42,468 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:42,469 INFO L427 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:42,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:42,469 INFO L82 PathProgramCache]: Analyzing trace with hash 974031856, now seen corresponding path program 327 times [2020-02-10 20:13:42,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:42,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970770271] [2020-02-10 20:13:42,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:42,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970770271] [2020-02-10 20:13:42,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:42,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:42,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810694886] [2020-02-10 20:13:42,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:42,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:42,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:42,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:42,671 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-02-10 20:13:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:42,746 INFO L93 Difference]: Finished difference Result 311 states and 758 transitions. [2020-02-10 20:13:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:42,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:42,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:42,747 INFO L225 Difference]: With dead ends: 311 [2020-02-10 20:13:42,747 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:13:42,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:13:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 195. [2020-02-10 20:13:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-02-10 20:13:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 562 transitions. [2020-02-10 20:13:42,752 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 562 transitions. Word has length 19 [2020-02-10 20:13:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:42,752 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 562 transitions. [2020-02-10 20:13:42,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 562 transitions. [2020-02-10 20:13:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:42,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:42,753 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:42,753 INFO L427 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:42,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2172894, now seen corresponding path program 328 times [2020-02-10 20:13:42,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:42,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566571172] [2020-02-10 20:13:42,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:42,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566571172] [2020-02-10 20:13:42,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:42,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:42,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922321695] [2020-02-10 20:13:42,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:42,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:42,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:42,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:42,943 INFO L87 Difference]: Start difference. First operand 195 states and 562 transitions. Second operand 8 states. [2020-02-10 20:13:43,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:43,036 INFO L93 Difference]: Finished difference Result 308 states and 747 transitions. [2020-02-10 20:13:43,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:43,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:43,037 INFO L225 Difference]: With dead ends: 308 [2020-02-10 20:13:43,038 INFO L226 Difference]: Without dead ends: 289 [2020-02-10 20:13:43,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-02-10 20:13:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 189. [2020-02-10 20:13:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 548 transitions. [2020-02-10 20:13:43,042 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 548 transitions. Word has length 19 [2020-02-10 20:13:43,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:43,042 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 548 transitions. [2020-02-10 20:13:43,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:43,042 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 548 transitions. [2020-02-10 20:13:43,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:43,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:43,043 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:43,043 INFO L427 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:43,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:43,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1309572854, now seen corresponding path program 329 times [2020-02-10 20:13:43,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:43,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309954712] [2020-02-10 20:13:43,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:43,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309954712] [2020-02-10 20:13:43,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:43,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:43,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233789452] [2020-02-10 20:13:43,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:43,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:43,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:43,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:43,235 INFO L87 Difference]: Start difference. First operand 189 states and 548 transitions. Second operand 8 states. [2020-02-10 20:13:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:43,307 INFO L93 Difference]: Finished difference Result 295 states and 719 transitions. [2020-02-10 20:13:43,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:43,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:43,309 INFO L225 Difference]: With dead ends: 295 [2020-02-10 20:13:43,309 INFO L226 Difference]: Without dead ends: 285 [2020-02-10 20:13:43,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-02-10 20:13:43,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 191. [2020-02-10 20:13:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 20:13:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 551 transitions. [2020-02-10 20:13:43,313 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 551 transitions. Word has length 19 [2020-02-10 20:13:43,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:43,313 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 551 transitions. [2020-02-10 20:13:43,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:43,313 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 551 transitions. [2020-02-10 20:13:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:43,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:43,313 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:43,314 INFO L427 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:43,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:43,314 INFO L82 PathProgramCache]: Analyzing trace with hash 179832142, now seen corresponding path program 330 times [2020-02-10 20:13:43,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:43,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144135902] [2020-02-10 20:13:43,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:43,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144135902] [2020-02-10 20:13:43,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:43,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:43,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080912226] [2020-02-10 20:13:43,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:43,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:43,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:43,503 INFO L87 Difference]: Start difference. First operand 191 states and 551 transitions. Second operand 8 states. [2020-02-10 20:13:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:43,586 INFO L93 Difference]: Finished difference Result 293 states and 714 transitions. [2020-02-10 20:13:43,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:43,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:43,588 INFO L225 Difference]: With dead ends: 293 [2020-02-10 20:13:43,588 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 20:13:43,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 20:13:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 186. [2020-02-10 20:13:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:13:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 542 transitions. [2020-02-10 20:13:43,592 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 542 transitions. Word has length 19 [2020-02-10 20:13:43,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:43,592 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 542 transitions. [2020-02-10 20:13:43,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 542 transitions. [2020-02-10 20:13:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:43,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:43,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:43,593 INFO L427 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:43,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:43,593 INFO L82 PathProgramCache]: Analyzing trace with hash -245646298, now seen corresponding path program 331 times [2020-02-10 20:13:43,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:43,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973285011] [2020-02-10 20:13:43,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:43,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:13:43,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973285011] [2020-02-10 20:13:43,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:43,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:43,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810280359] [2020-02-10 20:13:43,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:43,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:43,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:43,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:43,791 INFO L87 Difference]: Start difference. First operand 186 states and 542 transitions. Second operand 8 states. [2020-02-10 20:13:43,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:43,879 INFO L93 Difference]: Finished difference Result 283 states and 694 transitions. [2020-02-10 20:13:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:43,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:43,881 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:13:43,881 INFO L226 Difference]: Without dead ends: 273 [2020-02-10 20:13:43,881 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-02-10 20:13:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 188. [2020-02-10 20:13:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:13:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 546 transitions. [2020-02-10 20:13:43,886 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 546 transitions. Word has length 19 [2020-02-10 20:13:43,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:43,886 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 546 transitions. [2020-02-10 20:13:43,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 546 transitions. [2020-02-10 20:13:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:43,886 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:43,886 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:43,887 INFO L427 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:43,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:43,887 INFO L82 PathProgramCache]: Analyzing trace with hash -485288636, now seen corresponding path program 332 times [2020-02-10 20:13:43,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:43,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874191654] [2020-02-10 20:13:43,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:44,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874191654] [2020-02-10 20:13:44,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:44,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:44,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725749873] [2020-02-10 20:13:44,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:44,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:44,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:44,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:44,092 INFO L87 Difference]: Start difference. First operand 188 states and 546 transitions. Second operand 8 states. [2020-02-10 20:13:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:44,155 INFO L93 Difference]: Finished difference Result 283 states and 693 transitions. [2020-02-10 20:13:44,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:44,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:44,156 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:13:44,157 INFO L226 Difference]: Without dead ends: 272 [2020-02-10 20:13:44,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-02-10 20:13:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 187. [2020-02-10 20:13:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:13:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-02-10 20:13:44,161 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-02-10 20:13:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:44,162 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-02-10 20:13:44,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-02-10 20:13:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:44,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:44,162 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:44,162 INFO L427 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:44,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1318731678, now seen corresponding path program 333 times [2020-02-10 20:13:44,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:44,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252118580] [2020-02-10 20:13:44,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:44,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252118580] [2020-02-10 20:13:44,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:44,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:44,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768299036] [2020-02-10 20:13:44,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:44,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:44,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:44,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:44,354 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-02-10 20:13:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:44,438 INFO L93 Difference]: Finished difference Result 280 states and 688 transitions. [2020-02-10 20:13:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:44,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:44,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:44,439 INFO L225 Difference]: With dead ends: 280 [2020-02-10 20:13:44,439 INFO L226 Difference]: Without dead ends: 270 [2020-02-10 20:13:44,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-02-10 20:13:44,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 189. [2020-02-10 20:13:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:44,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 547 transitions. [2020-02-10 20:13:44,444 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 547 transitions. Word has length 19 [2020-02-10 20:13:44,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:44,444 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 547 transitions. [2020-02-10 20:13:44,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 547 transitions. [2020-02-10 20:13:44,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:44,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:44,445 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:44,445 INFO L427 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:44,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:44,445 INFO L82 PathProgramCache]: Analyzing trace with hash -363752674, now seen corresponding path program 334 times [2020-02-10 20:13:44,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:44,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550967025] [2020-02-10 20:13:44,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:44,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550967025] [2020-02-10 20:13:44,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:44,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:44,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392561803] [2020-02-10 20:13:44,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:44,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:44,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:44,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:44,638 INFO L87 Difference]: Start difference. First operand 189 states and 547 transitions. Second operand 8 states. [2020-02-10 20:13:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:44,721 INFO L93 Difference]: Finished difference Result 283 states and 693 transitions. [2020-02-10 20:13:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:44,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:44,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:44,723 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:13:44,723 INFO L226 Difference]: Without dead ends: 268 [2020-02-10 20:13:44,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-02-10 20:13:44,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 187. [2020-02-10 20:13:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:13:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-02-10 20:13:44,726 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-02-10 20:13:44,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:44,726 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-02-10 20:13:44,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:44,727 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-02-10 20:13:44,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:44,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:44,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:44,727 INFO L427 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:44,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:44,727 INFO L82 PathProgramCache]: Analyzing trace with hash 52566942, now seen corresponding path program 335 times [2020-02-10 20:13:44,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:44,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019422864] [2020-02-10 20:13:44,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:44,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019422864] [2020-02-10 20:13:44,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:44,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:44,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901209240] [2020-02-10 20:13:44,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:44,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:44,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:44,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:44,932 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-02-10 20:13:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:45,006 INFO L93 Difference]: Finished difference Result 278 states and 682 transitions. [2020-02-10 20:13:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:45,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:45,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:45,008 INFO L225 Difference]: With dead ends: 278 [2020-02-10 20:13:45,008 INFO L226 Difference]: Without dead ends: 268 [2020-02-10 20:13:45,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:45,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-02-10 20:13:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 189. [2020-02-10 20:13:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 546 transitions. [2020-02-10 20:13:45,012 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 546 transitions. Word has length 19 [2020-02-10 20:13:45,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:45,012 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 546 transitions. [2020-02-10 20:13:45,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:45,012 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 546 transitions. [2020-02-10 20:13:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:45,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:45,012 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:45,013 INFO L427 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:45,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1541971938, now seen corresponding path program 336 times [2020-02-10 20:13:45,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:45,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587800237] [2020-02-10 20:13:45,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:45,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587800237] [2020-02-10 20:13:45,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:45,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:45,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447885615] [2020-02-10 20:13:45,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:45,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:45,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:45,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:45,205 INFO L87 Difference]: Start difference. First operand 189 states and 546 transitions. Second operand 8 states. [2020-02-10 20:13:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:45,289 INFO L93 Difference]: Finished difference Result 276 states and 677 transitions. [2020-02-10 20:13:45,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:45,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:45,290 INFO L225 Difference]: With dead ends: 276 [2020-02-10 20:13:45,291 INFO L226 Difference]: Without dead ends: 258 [2020-02-10 20:13:45,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:45,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-02-10 20:13:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 184. [2020-02-10 20:13:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:13:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 538 transitions. [2020-02-10 20:13:45,295 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 538 transitions. Word has length 19 [2020-02-10 20:13:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:45,295 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 538 transitions. [2020-02-10 20:13:45,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 538 transitions. [2020-02-10 20:13:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:45,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:45,296 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:45,296 INFO L427 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:45,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1064346626, now seen corresponding path program 337 times [2020-02-10 20:13:45,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:45,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871655784] [2020-02-10 20:13:45,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:45,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871655784] [2020-02-10 20:13:45,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:45,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:45,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32407698] [2020-02-10 20:13:45,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:45,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:45,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:45,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:45,482 INFO L87 Difference]: Start difference. First operand 184 states and 538 transitions. Second operand 8 states. [2020-02-10 20:13:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:45,575 INFO L93 Difference]: Finished difference Result 296 states and 736 transitions. [2020-02-10 20:13:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:45,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:45,576 INFO L225 Difference]: With dead ends: 296 [2020-02-10 20:13:45,576 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 20:13:45,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:45,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 20:13:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 188. [2020-02-10 20:13:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:13:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 548 transitions. [2020-02-10 20:13:45,580 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 548 transitions. Word has length 19 [2020-02-10 20:13:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:45,580 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 548 transitions. [2020-02-10 20:13:45,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:45,580 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 548 transitions. [2020-02-10 20:13:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:45,581 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:45,581 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:45,581 INFO L427 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:45,581 INFO L82 PathProgramCache]: Analyzing trace with hash 190011300, now seen corresponding path program 338 times [2020-02-10 20:13:45,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:45,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529544235] [2020-02-10 20:13:45,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:45,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529544235] [2020-02-10 20:13:45,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:45,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:45,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300833757] [2020-02-10 20:13:45,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:45,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:45,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:45,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:45,781 INFO L87 Difference]: Start difference. First operand 188 states and 548 transitions. Second operand 8 states. [2020-02-10 20:13:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:45,866 INFO L93 Difference]: Finished difference Result 292 states and 725 transitions. [2020-02-10 20:13:45,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:45,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:45,867 INFO L225 Difference]: With dead ends: 292 [2020-02-10 20:13:45,867 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 20:13:45,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 20:13:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 186. [2020-02-10 20:13:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:13:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 544 transitions. [2020-02-10 20:13:45,872 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 544 transitions. Word has length 19 [2020-02-10 20:13:45,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:45,872 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 544 transitions. [2020-02-10 20:13:45,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 544 transitions. [2020-02-10 20:13:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:45,873 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:45,873 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:45,873 INFO L427 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:45,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:45,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2069598556, now seen corresponding path program 339 times [2020-02-10 20:13:45,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:45,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118478706] [2020-02-10 20:13:45,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:46,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118478706] [2020-02-10 20:13:46,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:46,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:46,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91441543] [2020-02-10 20:13:46,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:46,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:46,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:46,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:46,060 INFO L87 Difference]: Start difference. First operand 186 states and 544 transitions. Second operand 8 states. [2020-02-10 20:13:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:46,137 INFO L93 Difference]: Finished difference Result 296 states and 735 transitions. [2020-02-10 20:13:46,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:46,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:46,138 INFO L225 Difference]: With dead ends: 296 [2020-02-10 20:13:46,138 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 20:13:46,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 20:13:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 188. [2020-02-10 20:13:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:13:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 547 transitions. [2020-02-10 20:13:46,143 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 547 transitions. Word has length 19 [2020-02-10 20:13:46,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:46,143 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 547 transitions. [2020-02-10 20:13:46,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 547 transitions. [2020-02-10 20:13:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:46,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:46,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:46,144 INFO L427 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:46,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:46,144 INFO L82 PathProgramCache]: Analyzing trace with hash -949468726, now seen corresponding path program 340 times [2020-02-10 20:13:46,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:46,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086933131] [2020-02-10 20:13:46,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:46,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086933131] [2020-02-10 20:13:46,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:46,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:46,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675674421] [2020-02-10 20:13:46,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:46,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:46,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:46,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:46,337 INFO L87 Difference]: Start difference. First operand 188 states and 547 transitions. Second operand 8 states. [2020-02-10 20:13:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:46,404 INFO L93 Difference]: Finished difference Result 292 states and 724 transitions. [2020-02-10 20:13:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:46,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:46,405 INFO L225 Difference]: With dead ends: 292 [2020-02-10 20:13:46,406 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 20:13:46,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 20:13:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 186. [2020-02-10 20:13:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:13:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 543 transitions. [2020-02-10 20:13:46,411 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 543 transitions. Word has length 19 [2020-02-10 20:13:46,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:46,411 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 543 transitions. [2020-02-10 20:13:46,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:46,411 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 543 transitions. [2020-02-10 20:13:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:46,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:46,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:46,411 INFO L427 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:46,412 INFO L82 PathProgramCache]: Analyzing trace with hash -171970810, now seen corresponding path program 341 times [2020-02-10 20:13:46,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:46,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354840817] [2020-02-10 20:13:46,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:46,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354840817] [2020-02-10 20:13:46,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:46,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:46,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622098702] [2020-02-10 20:13:46,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:46,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:46,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:46,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:46,613 INFO L87 Difference]: Start difference. First operand 186 states and 543 transitions. Second operand 8 states. [2020-02-10 20:13:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:46,704 INFO L93 Difference]: Finished difference Result 287 states and 713 transitions. [2020-02-10 20:13:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:46,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:46,705 INFO L225 Difference]: With dead ends: 287 [2020-02-10 20:13:46,705 INFO L226 Difference]: Without dead ends: 277 [2020-02-10 20:13:46,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-02-10 20:13:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 187. [2020-02-10 20:13:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:13:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-02-10 20:13:46,710 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-02-10 20:13:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:46,710 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-02-10 20:13:46,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-02-10 20:13:46,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:46,710 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:46,710 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:46,710 INFO L427 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:46,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:46,711 INFO L82 PathProgramCache]: Analyzing trace with hash -411613148, now seen corresponding path program 342 times [2020-02-10 20:13:46,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:46,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56130819] [2020-02-10 20:13:46,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:46,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56130819] [2020-02-10 20:13:46,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:46,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:46,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362791791] [2020-02-10 20:13:46,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:46,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:46,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:46,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:46,923 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-02-10 20:13:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:46,994 INFO L93 Difference]: Finished difference Result 287 states and 712 transitions. [2020-02-10 20:13:46,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:46,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:46,996 INFO L225 Difference]: With dead ends: 287 [2020-02-10 20:13:46,996 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 20:13:46,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 20:13:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 185. [2020-02-10 20:13:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 20:13:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 541 transitions. [2020-02-10 20:13:47,000 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 541 transitions. Word has length 19 [2020-02-10 20:13:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:47,000 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 541 transitions. [2020-02-10 20:13:47,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 541 transitions. [2020-02-10 20:13:47,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:47,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:47,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:47,000 INFO L427 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:47,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:47,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2136529082, now seen corresponding path program 343 times [2020-02-10 20:13:47,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:47,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410008714] [2020-02-10 20:13:47,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:47,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410008714] [2020-02-10 20:13:47,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:47,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:47,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386929777] [2020-02-10 20:13:47,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:47,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:47,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:47,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:47,173 INFO L87 Difference]: Start difference. First operand 185 states and 541 transitions. Second operand 8 states. [2020-02-10 20:13:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:47,250 INFO L93 Difference]: Finished difference Result 297 states and 737 transitions. [2020-02-10 20:13:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:47,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:47,252 INFO L225 Difference]: With dead ends: 297 [2020-02-10 20:13:47,252 INFO L226 Difference]: Without dead ends: 283 [2020-02-10 20:13:47,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-02-10 20:13:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 189. [2020-02-10 20:13:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:47,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-02-10 20:13:47,256 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-02-10 20:13:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:47,256 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-02-10 20:13:47,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-02-10 20:13:47,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:47,256 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:47,257 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:47,257 INFO L427 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:47,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:47,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1284102888, now seen corresponding path program 344 times [2020-02-10 20:13:47,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:47,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395537719] [2020-02-10 20:13:47,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:47,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395537719] [2020-02-10 20:13:47,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:47,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:47,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454434683] [2020-02-10 20:13:47,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:47,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:47,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:47,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:47,431 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-02-10 20:13:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:47,519 INFO L93 Difference]: Finished difference Result 293 states and 726 transitions. [2020-02-10 20:13:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:47,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:47,520 INFO L225 Difference]: With dead ends: 293 [2020-02-10 20:13:47,520 INFO L226 Difference]: Without dead ends: 281 [2020-02-10 20:13:47,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-02-10 20:13:47,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 187. [2020-02-10 20:13:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:13:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 546 transitions. [2020-02-10 20:13:47,524 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 546 transitions. Word has length 19 [2020-02-10 20:13:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:47,524 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 546 transitions. [2020-02-10 20:13:47,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 546 transitions. [2020-02-10 20:13:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:47,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:47,525 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:47,525 INFO L427 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:47,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1698016266, now seen corresponding path program 345 times [2020-02-10 20:13:47,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:47,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315058427] [2020-02-10 20:13:47,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:47,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315058427] [2020-02-10 20:13:47,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:47,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:47,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658381993] [2020-02-10 20:13:47,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:47,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:47,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:47,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:47,702 INFO L87 Difference]: Start difference. First operand 187 states and 546 transitions. Second operand 8 states. [2020-02-10 20:13:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:47,796 INFO L93 Difference]: Finished difference Result 303 states and 752 transitions. [2020-02-10 20:13:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:47,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:47,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:47,797 INFO L225 Difference]: With dead ends: 303 [2020-02-10 20:13:47,797 INFO L226 Difference]: Without dead ends: 289 [2020-02-10 20:13:47,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-02-10 20:13:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2020-02-10 20:13:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:13:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-02-10 20:13:47,802 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-02-10 20:13:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:47,802 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-02-10 20:13:47,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-02-10 20:13:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:47,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:47,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:47,803 INFO L427 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:47,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:47,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1628066990, now seen corresponding path program 346 times [2020-02-10 20:13:47,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:47,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442495255] [2020-02-10 20:13:47,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:47,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442495255] [2020-02-10 20:13:47,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:47,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:47,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722959037] [2020-02-10 20:13:47,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:47,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:47,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:47,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:47,978 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-02-10 20:13:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:48,055 INFO L93 Difference]: Finished difference Result 302 states and 745 transitions. [2020-02-10 20:13:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:48,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:48,057 INFO L225 Difference]: With dead ends: 302 [2020-02-10 20:13:48,057 INFO L226 Difference]: Without dead ends: 284 [2020-02-10 20:13:48,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-02-10 20:13:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 187. [2020-02-10 20:13:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:13:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-02-10 20:13:48,061 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-02-10 20:13:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:48,061 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-02-10 20:13:48,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-02-10 20:13:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:48,061 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:48,061 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:48,061 INFO L427 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:48,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:48,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1237178862, now seen corresponding path program 347 times [2020-02-10 20:13:48,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:48,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289075816] [2020-02-10 20:13:48,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:48,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:13:48,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289075816] [2020-02-10 20:13:48,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:48,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:48,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141897461] [2020-02-10 20:13:48,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:48,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:48,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:48,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:48,241 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-02-10 20:13:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:48,317 INFO L93 Difference]: Finished difference Result 292 states and 722 transitions. [2020-02-10 20:13:48,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:48,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:48,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:48,318 INFO L225 Difference]: With dead ends: 292 [2020-02-10 20:13:48,318 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 20:13:48,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 20:13:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 189. [2020-02-10 20:13:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 547 transitions. [2020-02-10 20:13:48,322 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 547 transitions. Word has length 19 [2020-02-10 20:13:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:48,322 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 547 transitions. [2020-02-10 20:13:48,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 547 transitions. [2020-02-10 20:13:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:48,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:48,323 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:48,323 INFO L427 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:48,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:48,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1328741100, now seen corresponding path program 348 times [2020-02-10 20:13:48,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:48,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923586904] [2020-02-10 20:13:48,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:48,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923586904] [2020-02-10 20:13:48,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:48,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:48,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524152040] [2020-02-10 20:13:48,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:48,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:48,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:48,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:48,494 INFO L87 Difference]: Start difference. First operand 189 states and 547 transitions. Second operand 8 states. [2020-02-10 20:13:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:48,585 INFO L93 Difference]: Finished difference Result 295 states and 727 transitions. [2020-02-10 20:13:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:48,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:48,586 INFO L225 Difference]: With dead ends: 295 [2020-02-10 20:13:48,586 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 20:13:48,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 20:13:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 185. [2020-02-10 20:13:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 20:13:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 540 transitions. [2020-02-10 20:13:48,590 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 540 transitions. Word has length 19 [2020-02-10 20:13:48,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:48,591 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 540 transitions. [2020-02-10 20:13:48,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 540 transitions. [2020-02-10 20:13:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:48,591 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:48,591 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:48,591 INFO L427 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:48,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:48,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1719022474, now seen corresponding path program 349 times [2020-02-10 20:13:48,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:48,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763492103] [2020-02-10 20:13:48,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:48,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:13:48,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763492103] [2020-02-10 20:13:48,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:48,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:48,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532775458] [2020-02-10 20:13:48,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:48,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:48,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:48,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:48,775 INFO L87 Difference]: Start difference. First operand 185 states and 540 transitions. Second operand 8 states. [2020-02-10 20:13:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:48,852 INFO L93 Difference]: Finished difference Result 295 states and 729 transitions. [2020-02-10 20:13:48,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:48,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:48,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:48,853 INFO L225 Difference]: With dead ends: 295 [2020-02-10 20:13:48,854 INFO L226 Difference]: Without dead ends: 281 [2020-02-10 20:13:48,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-02-10 20:13:48,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 189. [2020-02-10 20:13:48,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-02-10 20:13:48,858 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-02-10 20:13:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:48,858 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-02-10 20:13:48,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-02-10 20:13:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:48,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:48,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:48,859 INFO L427 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:48,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:48,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1455814992, now seen corresponding path program 350 times [2020-02-10 20:13:48,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:48,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168232298] [2020-02-10 20:13:48,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:49,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168232298] [2020-02-10 20:13:49,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:49,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:49,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596867365] [2020-02-10 20:13:49,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:49,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:49,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:49,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:49,048 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-02-10 20:13:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:49,111 INFO L93 Difference]: Finished difference Result 291 states and 718 transitions. [2020-02-10 20:13:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:49,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:49,113 INFO L225 Difference]: With dead ends: 291 [2020-02-10 20:13:49,113 INFO L226 Difference]: Without dead ends: 279 [2020-02-10 20:13:49,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-02-10 20:13:49,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 187. [2020-02-10 20:13:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:13:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 545 transitions. [2020-02-10 20:13:49,117 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 545 transitions. Word has length 19 [2020-02-10 20:13:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:49,117 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 545 transitions. [2020-02-10 20:13:49,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 545 transitions. [2020-02-10 20:13:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:49,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:49,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:49,118 INFO L427 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:49,118 INFO L82 PathProgramCache]: Analyzing trace with hash 645937094, now seen corresponding path program 351 times [2020-02-10 20:13:49,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:49,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289193839] [2020-02-10 20:13:49,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:49,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289193839] [2020-02-10 20:13:49,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:49,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:49,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692903740] [2020-02-10 20:13:49,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:49,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:49,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:49,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:49,309 INFO L87 Difference]: Start difference. First operand 187 states and 545 transitions. Second operand 8 states. [2020-02-10 20:13:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:49,398 INFO L93 Difference]: Finished difference Result 296 states and 729 transitions. [2020-02-10 20:13:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:49,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:49,399 INFO L225 Difference]: With dead ends: 296 [2020-02-10 20:13:49,399 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 20:13:49,399 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 20:13:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 192. [2020-02-10 20:13:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:13:49,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 555 transitions. [2020-02-10 20:13:49,403 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 555 transitions. Word has length 19 [2020-02-10 20:13:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:49,404 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 555 transitions. [2020-02-10 20:13:49,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 555 transitions. [2020-02-10 20:13:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:49,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:49,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:49,404 INFO L427 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:49,404 INFO L82 PathProgramCache]: Analyzing trace with hash 3880176, now seen corresponding path program 352 times [2020-02-10 20:13:49,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:49,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036425572] [2020-02-10 20:13:49,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:49,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036425572] [2020-02-10 20:13:49,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:49,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:49,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910166466] [2020-02-10 20:13:49,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:49,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:49,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:49,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:49,589 INFO L87 Difference]: Start difference. First operand 192 states and 555 transitions. Second operand 8 states. [2020-02-10 20:13:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:49,671 INFO L93 Difference]: Finished difference Result 295 states and 722 transitions. [2020-02-10 20:13:49,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:49,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:49,673 INFO L225 Difference]: With dead ends: 295 [2020-02-10 20:13:49,673 INFO L226 Difference]: Without dead ends: 277 [2020-02-10 20:13:49,673 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-02-10 20:13:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 187. [2020-02-10 20:13:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:13:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-02-10 20:13:49,679 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-02-10 20:13:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:49,679 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-02-10 20:13:49,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-02-10 20:13:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:49,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:49,680 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:49,680 INFO L427 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:49,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:49,681 INFO L82 PathProgramCache]: Analyzing trace with hash -380103836, now seen corresponding path program 353 times [2020-02-10 20:13:49,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:49,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411522740] [2020-02-10 20:13:49,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:49,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:13:49,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411522740] [2020-02-10 20:13:49,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:49,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:49,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651833968] [2020-02-10 20:13:49,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:49,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:49,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:49,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:49,878 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-02-10 20:13:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:49,935 INFO L93 Difference]: Finished difference Result 285 states and 699 transitions. [2020-02-10 20:13:49,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:49,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:49,937 INFO L225 Difference]: With dead ends: 285 [2020-02-10 20:13:49,937 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 20:13:49,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:49,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 20:13:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 189. [2020-02-10 20:13:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 20:13:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 546 transitions. [2020-02-10 20:13:49,941 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 546 transitions. Word has length 19 [2020-02-10 20:13:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:49,941 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 546 transitions. [2020-02-10 20:13:49,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 546 transitions. [2020-02-10 20:13:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:49,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:49,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:49,941 INFO L427 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:49,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1109301160, now seen corresponding path program 354 times [2020-02-10 20:13:49,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:49,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121260259] [2020-02-10 20:13:49,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:50,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121260259] [2020-02-10 20:13:50,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:50,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:50,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035453751] [2020-02-10 20:13:50,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:50,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:50,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:50,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:50,130 INFO L87 Difference]: Start difference. First operand 189 states and 546 transitions. Second operand 8 states. [2020-02-10 20:13:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:50,211 INFO L93 Difference]: Finished difference Result 283 states and 694 transitions. [2020-02-10 20:13:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:50,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:50,212 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:13:50,212 INFO L226 Difference]: Without dead ends: 266 [2020-02-10 20:13:50,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-02-10 20:13:50,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 185. [2020-02-10 20:13:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 20:13:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 539 transitions. [2020-02-10 20:13:50,217 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 539 transitions. Word has length 19 [2020-02-10 20:13:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:50,217 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 539 transitions. [2020-02-10 20:13:50,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 539 transitions. [2020-02-10 20:13:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:50,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:50,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:50,218 INFO L427 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:50,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1184663342, now seen corresponding path program 355 times [2020-02-10 20:13:50,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:50,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108928814] [2020-02-10 20:13:50,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:50,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108928814] [2020-02-10 20:13:50,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:50,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:50,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258036042] [2020-02-10 20:13:50,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:50,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:50,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:50,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:50,424 INFO L87 Difference]: Start difference. First operand 185 states and 539 transitions. Second operand 8 states. [2020-02-10 20:13:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:50,507 INFO L93 Difference]: Finished difference Result 277 states and 681 transitions. [2020-02-10 20:13:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:50,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:50,508 INFO L225 Difference]: With dead ends: 277 [2020-02-10 20:13:50,508 INFO L226 Difference]: Without dead ends: 267 [2020-02-10 20:13:50,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:50,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-02-10 20:13:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 187. [2020-02-10 20:13:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:13:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-02-10 20:13:50,513 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-02-10 20:13:50,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:50,513 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-02-10 20:13:50,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:50,513 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-02-10 20:13:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:50,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:50,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:50,514 INFO L427 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:50,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:50,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1424305680, now seen corresponding path program 356 times [2020-02-10 20:13:50,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:50,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605869261] [2020-02-10 20:13:50,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:50,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605869261] [2020-02-10 20:13:50,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:50,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:50,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506350979] [2020-02-10 20:13:50,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:50,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:50,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:50,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:50,725 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-02-10 20:13:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:50,784 INFO L93 Difference]: Finished difference Result 277 states and 680 transitions. [2020-02-10 20:13:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:50,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:50,785 INFO L225 Difference]: With dead ends: 277 [2020-02-10 20:13:50,785 INFO L226 Difference]: Without dead ends: 266 [2020-02-10 20:13:50,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:50,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-02-10 20:13:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 186. [2020-02-10 20:13:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:13:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 541 transitions. [2020-02-10 20:13:50,789 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 541 transitions. Word has length 19 [2020-02-10 20:13:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:50,790 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 541 transitions. [2020-02-10 20:13:50,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 541 transitions. [2020-02-10 20:13:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:50,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:50,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:50,790 INFO L427 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:50,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2037218574, now seen corresponding path program 357 times [2020-02-10 20:13:50,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:50,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611822238] [2020-02-10 20:13:50,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:50,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611822238] [2020-02-10 20:13:50,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:50,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:50,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107313246] [2020-02-10 20:13:50,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:50,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:50,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:50,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:50,979 INFO L87 Difference]: Start difference. First operand 186 states and 541 transitions. Second operand 8 states. [2020-02-10 20:13:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:51,055 INFO L93 Difference]: Finished difference Result 274 states and 675 transitions. [2020-02-10 20:13:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:51,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:51,057 INFO L225 Difference]: With dead ends: 274 [2020-02-10 20:13:51,057 INFO L226 Difference]: Without dead ends: 264 [2020-02-10 20:13:51,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-02-10 20:13:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 188. [2020-02-10 20:13:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:13:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 544 transitions. [2020-02-10 20:13:51,062 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 544 transitions. Word has length 19 [2020-02-10 20:13:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:51,062 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 544 transitions. [2020-02-10 20:13:51,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 544 transitions. [2020-02-10 20:13:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:51,062 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:51,062 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:51,062 INFO L427 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:51,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:51,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1302769718, now seen corresponding path program 358 times [2020-02-10 20:13:51,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:51,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644466020] [2020-02-10 20:13:51,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:51,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:13:51,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644466020] [2020-02-10 20:13:51,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:51,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:51,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137516052] [2020-02-10 20:13:51,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:51,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:51,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:51,252 INFO L87 Difference]: Start difference. First operand 188 states and 544 transitions. Second operand 8 states. [2020-02-10 20:13:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:51,337 INFO L93 Difference]: Finished difference Result 277 states and 680 transitions. [2020-02-10 20:13:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:51,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:51,338 INFO L225 Difference]: With dead ends: 277 [2020-02-10 20:13:51,338 INFO L226 Difference]: Without dead ends: 262 [2020-02-10 20:13:51,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:51,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-02-10 20:13:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 186. [2020-02-10 20:13:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:13:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 540 transitions. [2020-02-10 20:13:51,343 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 540 transitions. Word has length 19 [2020-02-10 20:13:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:51,343 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 540 transitions. [2020-02-10 20:13:51,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 540 transitions. [2020-02-10 20:13:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:51,344 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:51,344 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:51,344 INFO L427 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:51,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:51,344 INFO L82 PathProgramCache]: Analyzing trace with hash -886450102, now seen corresponding path program 359 times [2020-02-10 20:13:51,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:51,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130360825] [2020-02-10 20:13:51,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:51,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130360825] [2020-02-10 20:13:51,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:51,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:51,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647585862] [2020-02-10 20:13:51,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:51,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:51,538 INFO L87 Difference]: Start difference. First operand 186 states and 540 transitions. Second operand 8 states. [2020-02-10 20:13:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:51,611 INFO L93 Difference]: Finished difference Result 272 states and 669 transitions. [2020-02-10 20:13:51,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:51,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:51,612 INFO L225 Difference]: With dead ends: 272 [2020-02-10 20:13:51,613 INFO L226 Difference]: Without dead ends: 262 [2020-02-10 20:13:51,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-02-10 20:13:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 188. [2020-02-10 20:13:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 20:13:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 543 transitions. [2020-02-10 20:13:51,617 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 543 transitions. Word has length 19 [2020-02-10 20:13:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:51,617 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 543 transitions. [2020-02-10 20:13:51,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 543 transitions. [2020-02-10 20:13:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:51,617 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:51,617 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:51,618 INFO L427 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:51,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:51,618 INFO L82 PathProgramCache]: Analyzing trace with hash 602954894, now seen corresponding path program 360 times [2020-02-10 20:13:51,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:51,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695171669] [2020-02-10 20:13:51,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:51,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:13:51,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695171669] [2020-02-10 20:13:51,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:51,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:51,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363996086] [2020-02-10 20:13:51,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:51,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:51,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:51,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:51,809 INFO L87 Difference]: Start difference. First operand 188 states and 543 transitions. Second operand 8 states. [2020-02-10 20:13:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:51,890 INFO L93 Difference]: Finished difference Result 270 states and 664 transitions. [2020-02-10 20:13:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:51,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:51,891 INFO L225 Difference]: With dead ends: 270 [2020-02-10 20:13:51,892 INFO L226 Difference]: Without dead ends: 249 [2020-02-10 20:13:51,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-02-10 20:13:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 180. [2020-02-10 20:13:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 20:13:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 530 transitions. [2020-02-10 20:13:51,896 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 530 transitions. Word has length 19 [2020-02-10 20:13:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:51,896 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 530 transitions. [2020-02-10 20:13:51,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 530 transitions. [2020-02-10 20:13:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:51,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:51,897 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:51,897 INFO L427 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash 234329704, now seen corresponding path program 361 times [2020-02-10 20:13:51,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:51,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671080939] [2020-02-10 20:13:51,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:52,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671080939] [2020-02-10 20:13:52,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:52,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:52,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795401744] [2020-02-10 20:13:52,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:52,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:52,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:52,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:52,109 INFO L87 Difference]: Start difference. First operand 180 states and 530 transitions. Second operand 8 states. [2020-02-10 20:13:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:52,169 INFO L93 Difference]: Finished difference Result 319 states and 780 transitions. [2020-02-10 20:13:52,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:52,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:52,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:52,170 INFO L225 Difference]: With dead ends: 319 [2020-02-10 20:13:52,171 INFO L226 Difference]: Without dead ends: 303 [2020-02-10 20:13:52,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-02-10 20:13:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 192. [2020-02-10 20:13:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:13:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-02-10 20:13:52,175 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-02-10 20:13:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:52,175 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-02-10 20:13:52,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-02-10 20:13:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:52,176 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:52,176 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:52,176 INFO L427 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:52,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:52,176 INFO L82 PathProgramCache]: Analyzing trace with hash 608980890, now seen corresponding path program 362 times [2020-02-10 20:13:52,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:52,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139881095] [2020-02-10 20:13:52,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:52,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:13:52,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139881095] [2020-02-10 20:13:52,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:52,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:52,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079453382] [2020-02-10 20:13:52,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:52,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:52,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:52,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:52,384 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-02-10 20:13:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:52,468 INFO L93 Difference]: Finished difference Result 317 states and 770 transitions. [2020-02-10 20:13:52,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:52,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:52,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:52,470 INFO L225 Difference]: With dead ends: 317 [2020-02-10 20:13:52,470 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:13:52,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:13:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-02-10 20:13:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:13:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 538 transitions. [2020-02-10 20:13:52,475 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 538 transitions. Word has length 19 [2020-02-10 20:13:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:52,475 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 538 transitions. [2020-02-10 20:13:52,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 538 transitions. [2020-02-10 20:13:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:52,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:52,476 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:52,476 INFO L427 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:52,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:52,476 INFO L82 PathProgramCache]: Analyzing trace with hash 438930786, now seen corresponding path program 363 times [2020-02-10 20:13:52,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:52,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761396569] [2020-02-10 20:13:52,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:52,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761396569] [2020-02-10 20:13:52,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:52,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:52,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819720811] [2020-02-10 20:13:52,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:52,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:52,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:52,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:52,682 INFO L87 Difference]: Start difference. First operand 184 states and 538 transitions. Second operand 8 states. [2020-02-10 20:13:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:52,741 INFO L93 Difference]: Finished difference Result 310 states and 753 transitions. [2020-02-10 20:13:52,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:52,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:52,742 INFO L225 Difference]: With dead ends: 310 [2020-02-10 20:13:52,742 INFO L226 Difference]: Without dead ends: 294 [2020-02-10 20:13:52,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-02-10 20:13:52,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 187. [2020-02-10 20:13:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:13:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 542 transitions. [2020-02-10 20:13:52,747 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 542 transitions. Word has length 19 [2020-02-10 20:13:52,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:52,747 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 542 transitions. [2020-02-10 20:13:52,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 542 transitions. [2020-02-10 20:13:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:52,748 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:52,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:52,748 INFO L427 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:52,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1712795760, now seen corresponding path program 364 times [2020-02-10 20:13:52,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:52,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838334816] [2020-02-10 20:13:52,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:52,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:52,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838334816] [2020-02-10 20:13:52,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:52,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:52,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675267993] [2020-02-10 20:13:52,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:52,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:52,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:52,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:52,949 INFO L87 Difference]: Start difference. First operand 187 states and 542 transitions. Second operand 8 states. [2020-02-10 20:13:53,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:53,031 INFO L93 Difference]: Finished difference Result 304 states and 738 transitions. [2020-02-10 20:13:53,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:53,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:53,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:53,032 INFO L225 Difference]: With dead ends: 304 [2020-02-10 20:13:53,033 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 20:13:53,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 20:13:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 184. [2020-02-10 20:13:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:13:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 535 transitions. [2020-02-10 20:13:53,037 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 535 transitions. Word has length 19 [2020-02-10 20:13:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:53,037 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 535 transitions. [2020-02-10 20:13:53,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 535 transitions. [2020-02-10 20:13:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:53,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:53,038 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:53,038 INFO L427 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:53,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:53,038 INFO L82 PathProgramCache]: Analyzing trace with hash -959085248, now seen corresponding path program 365 times [2020-02-10 20:13:53,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:53,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758663150] [2020-02-10 20:13:53,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:53,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:13:53,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758663150] [2020-02-10 20:13:53,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:53,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:53,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790253960] [2020-02-10 20:13:53,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:53,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:53,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:53,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:53,240 INFO L87 Difference]: Start difference. First operand 184 states and 535 transitions. Second operand 8 states. [2020-02-10 20:13:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:53,318 INFO L93 Difference]: Finished difference Result 305 states and 742 transitions. [2020-02-10 20:13:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:53,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:53,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:53,319 INFO L225 Difference]: With dead ends: 305 [2020-02-10 20:13:53,319 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 20:13:53,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 20:13:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 186. [2020-02-10 20:13:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:13:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 538 transitions. [2020-02-10 20:13:53,323 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 538 transitions. Word has length 19 [2020-02-10 20:13:53,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:53,323 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 538 transitions. [2020-02-10 20:13:53,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 538 transitions. [2020-02-10 20:13:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:53,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:53,323 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:53,324 INFO L427 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:53,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:53,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1833420574, now seen corresponding path program 366 times [2020-02-10 20:13:53,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:53,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093633076] [2020-02-10 20:13:53,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:53,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:13:53,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093633076] [2020-02-10 20:13:53,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:53,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:53,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352830659] [2020-02-10 20:13:53,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:53,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:53,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:53,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:53,521 INFO L87 Difference]: Start difference. First operand 186 states and 538 transitions. Second operand 8 states. [2020-02-10 20:13:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:53,602 INFO L93 Difference]: Finished difference Result 301 states and 731 transitions. [2020-02-10 20:13:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:53,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:53,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:53,604 INFO L225 Difference]: With dead ends: 301 [2020-02-10 20:13:53,604 INFO L226 Difference]: Without dead ends: 285 [2020-02-10 20:13:53,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-02-10 20:13:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 180. [2020-02-10 20:13:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 20:13:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 527 transitions. [2020-02-10 20:13:53,609 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 527 transitions. Word has length 19 [2020-02-10 20:13:53,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:53,609 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 527 transitions. [2020-02-10 20:13:53,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 527 transitions. [2020-02-10 20:13:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:53,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:53,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:53,609 INFO L427 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:53,610 INFO L82 PathProgramCache]: Analyzing trace with hash -188156022, now seen corresponding path program 367 times [2020-02-10 20:13:53,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:53,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730518217] [2020-02-10 20:13:53,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:53,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730518217] [2020-02-10 20:13:53,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:53,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:53,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418579813] [2020-02-10 20:13:53,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:53,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:53,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:53,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:53,822 INFO L87 Difference]: Start difference. First operand 180 states and 527 transitions. Second operand 8 states. [2020-02-10 20:13:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:53,887 INFO L93 Difference]: Finished difference Result 319 states and 777 transitions. [2020-02-10 20:13:53,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:53,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:53,888 INFO L225 Difference]: With dead ends: 319 [2020-02-10 20:13:53,888 INFO L226 Difference]: Without dead ends: 303 [2020-02-10 20:13:53,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-02-10 20:13:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 192. [2020-02-10 20:13:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 20:13:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 553 transitions. [2020-02-10 20:13:53,892 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 553 transitions. Word has length 19 [2020-02-10 20:13:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:53,892 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 553 transitions. [2020-02-10 20:13:53,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:53,892 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 553 transitions. [2020-02-10 20:13:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:53,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:53,893 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:53,893 INFO L427 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:53,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:53,893 INFO L82 PathProgramCache]: Analyzing trace with hash 186495164, now seen corresponding path program 368 times [2020-02-10 20:13:53,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:53,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042627001] [2020-02-10 20:13:53,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:54,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042627001] [2020-02-10 20:13:54,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:54,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:54,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140488028] [2020-02-10 20:13:54,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:54,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:54,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:54,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:54,098 INFO L87 Difference]: Start difference. First operand 192 states and 553 transitions. Second operand 8 states. [2020-02-10 20:13:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:54,173 INFO L93 Difference]: Finished difference Result 317 states and 767 transitions. [2020-02-10 20:13:54,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:54,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:54,174 INFO L225 Difference]: With dead ends: 317 [2020-02-10 20:13:54,174 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 20:13:54,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 20:13:54,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-02-10 20:13:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:13:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 535 transitions. [2020-02-10 20:13:54,178 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 535 transitions. Word has length 19 [2020-02-10 20:13:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:54,178 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 535 transitions. [2020-02-10 20:13:54,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 535 transitions. [2020-02-10 20:13:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:54,179 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:54,179 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:54,179 INFO L427 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:54,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:54,179 INFO L82 PathProgramCache]: Analyzing trace with hash 342041284, now seen corresponding path program 369 times [2020-02-10 20:13:54,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:54,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378217975] [2020-02-10 20:13:54,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:54,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378217975] [2020-02-10 20:13:54,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:54,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:54,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817657320] [2020-02-10 20:13:54,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:54,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:54,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:54,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:54,426 INFO L87 Difference]: Start difference. First operand 184 states and 535 transitions. Second operand 8 states. [2020-02-10 20:13:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:54,491 INFO L93 Difference]: Finished difference Result 310 states and 750 transitions. [2020-02-10 20:13:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:54,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:54,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:54,493 INFO L225 Difference]: With dead ends: 310 [2020-02-10 20:13:54,493 INFO L226 Difference]: Without dead ends: 294 [2020-02-10 20:13:54,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-02-10 20:13:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 187. [2020-02-10 20:13:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:13:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 539 transitions. [2020-02-10 20:13:54,497 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 539 transitions. Word has length 19 [2020-02-10 20:13:54,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:54,497 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 539 transitions. [2020-02-10 20:13:54,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 539 transitions. [2020-02-10 20:13:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:54,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:54,497 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:54,498 INFO L427 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:54,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:54,498 INFO L82 PathProgramCache]: Analyzing trace with hash 601099510, now seen corresponding path program 370 times [2020-02-10 20:13:54,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:54,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076921607] [2020-02-10 20:13:54,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:54,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076921607] [2020-02-10 20:13:54,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:54,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:54,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74143108] [2020-02-10 20:13:54,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:54,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:54,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:54,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:54,708 INFO L87 Difference]: Start difference. First operand 187 states and 539 transitions. Second operand 8 states. [2020-02-10 20:13:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:54,767 INFO L93 Difference]: Finished difference Result 304 states and 735 transitions. [2020-02-10 20:13:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:54,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:54,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:54,769 INFO L225 Difference]: With dead ends: 304 [2020-02-10 20:13:54,769 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 20:13:54,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 20:13:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 184. [2020-02-10 20:13:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:13:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 532 transitions. [2020-02-10 20:13:54,774 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 532 transitions. Word has length 19 [2020-02-10 20:13:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:54,774 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 532 transitions. [2020-02-10 20:13:54,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 532 transitions. [2020-02-10 20:13:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:54,775 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:54,775 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:54,775 INFO L427 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2030620292, now seen corresponding path program 371 times [2020-02-10 20:13:54,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:54,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559455888] [2020-02-10 20:13:54,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:54,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559455888] [2020-02-10 20:13:54,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:54,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:54,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808035107] [2020-02-10 20:13:54,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:54,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:54,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:54,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:54,977 INFO L87 Difference]: Start difference. First operand 184 states and 532 transitions. Second operand 8 states. [2020-02-10 20:13:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:55,061 INFO L93 Difference]: Finished difference Result 305 states and 739 transitions. [2020-02-10 20:13:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:55,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:55,062 INFO L225 Difference]: With dead ends: 305 [2020-02-10 20:13:55,062 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 20:13:55,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 20:13:55,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 186. [2020-02-10 20:13:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 20:13:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 535 transitions. [2020-02-10 20:13:55,067 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 535 transitions. Word has length 19 [2020-02-10 20:13:55,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:55,068 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 535 transitions. [2020-02-10 20:13:55,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 535 transitions. [2020-02-10 20:13:55,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:55,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:55,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:55,068 INFO L427 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:55,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:55,069 INFO L82 PathProgramCache]: Analyzing trace with hash -910490462, now seen corresponding path program 372 times [2020-02-10 20:13:55,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:55,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777839844] [2020-02-10 20:13:55,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:55,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777839844] [2020-02-10 20:13:55,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:55,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:55,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710547785] [2020-02-10 20:13:55,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:55,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:55,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:55,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:55,280 INFO L87 Difference]: Start difference. First operand 186 states and 535 transitions. Second operand 8 states. [2020-02-10 20:13:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:55,344 INFO L93 Difference]: Finished difference Result 301 states and 728 transitions. [2020-02-10 20:13:55,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:55,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:55,346 INFO L225 Difference]: With dead ends: 301 [2020-02-10 20:13:55,346 INFO L226 Difference]: Without dead ends: 285 [2020-02-10 20:13:55,346 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-02-10 20:13:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 180. [2020-02-10 20:13:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 20:13:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 524 transitions. [2020-02-10 20:13:55,351 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 524 transitions. Word has length 19 [2020-02-10 20:13:55,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:55,351 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 524 transitions. [2020-02-10 20:13:55,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:55,351 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 524 transitions. [2020-02-10 20:13:55,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:55,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:55,351 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:55,351 INFO L427 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:55,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:55,352 INFO L82 PathProgramCache]: Analyzing trace with hash -304821912, now seen corresponding path program 373 times [2020-02-10 20:13:55,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:55,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52457326] [2020-02-10 20:13:55,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:55,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52457326] [2020-02-10 20:13:55,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:55,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:55,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513979065] [2020-02-10 20:13:55,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:55,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:55,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:55,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:55,564 INFO L87 Difference]: Start difference. First operand 180 states and 524 transitions. Second operand 8 states. [2020-02-10 20:13:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:55,623 INFO L93 Difference]: Finished difference Result 298 states and 719 transitions. [2020-02-10 20:13:55,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:55,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:55,625 INFO L225 Difference]: With dead ends: 298 [2020-02-10 20:13:55,625 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 20:13:55,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 20:13:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 185. [2020-02-10 20:13:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 20:13:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 534 transitions. [2020-02-10 20:13:55,629 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 534 transitions. Word has length 19 [2020-02-10 20:13:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:55,630 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 534 transitions. [2020-02-10 20:13:55,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 534 transitions. [2020-02-10 20:13:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:55,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:55,630 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:55,630 INFO L427 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1838418838, now seen corresponding path program 374 times [2020-02-10 20:13:55,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:55,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888135196] [2020-02-10 20:13:55,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:55,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888135196] [2020-02-10 20:13:55,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:55,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:55,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147290422] [2020-02-10 20:13:55,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:55,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:55,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:55,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:55,833 INFO L87 Difference]: Start difference. First operand 185 states and 534 transitions. Second operand 8 states. [2020-02-10 20:13:55,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:55,920 INFO L93 Difference]: Finished difference Result 292 states and 704 transitions. [2020-02-10 20:13:55,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:55,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:55,922 INFO L225 Difference]: With dead ends: 292 [2020-02-10 20:13:55,922 INFO L226 Difference]: Without dead ends: 279 [2020-02-10 20:13:55,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-02-10 20:13:55,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 182. [2020-02-10 20:13:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-02-10 20:13:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 528 transitions. [2020-02-10 20:13:55,927 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 528 transitions. Word has length 19 [2020-02-10 20:13:55,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:55,927 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 528 transitions. [2020-02-10 20:13:55,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:55,927 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 528 transitions. [2020-02-10 20:13:55,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:55,928 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:55,928 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:55,928 INFO L427 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:55,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:55,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1905259766, now seen corresponding path program 375 times [2020-02-10 20:13:55,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:55,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021407802] [2020-02-10 20:13:55,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:56,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021407802] [2020-02-10 20:13:56,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:56,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:56,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715546948] [2020-02-10 20:13:56,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:56,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:56,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:56,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:56,135 INFO L87 Difference]: Start difference. First operand 182 states and 528 transitions. Second operand 8 states. [2020-02-10 20:13:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:56,194 INFO L93 Difference]: Finished difference Result 298 states and 717 transitions. [2020-02-10 20:13:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:56,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:56,195 INFO L225 Difference]: With dead ends: 298 [2020-02-10 20:13:56,195 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 20:13:56,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 20:13:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 185. [2020-02-10 20:13:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 20:13:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 532 transitions. [2020-02-10 20:13:56,199 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 532 transitions. Word has length 19 [2020-02-10 20:13:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:56,199 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 532 transitions. [2020-02-10 20:13:56,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 532 transitions. [2020-02-10 20:13:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:56,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:56,200 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:56,200 INFO L427 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1646201540, now seen corresponding path program 376 times [2020-02-10 20:13:56,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:56,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480573808] [2020-02-10 20:13:56,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:56,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480573808] [2020-02-10 20:13:56,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:56,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:56,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964901903] [2020-02-10 20:13:56,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:56,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:56,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:56,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:56,397 INFO L87 Difference]: Start difference. First operand 185 states and 532 transitions. Second operand 8 states. [2020-02-10 20:13:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:56,468 INFO L93 Difference]: Finished difference Result 292 states and 702 transitions. [2020-02-10 20:13:56,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:56,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:56,469 INFO L225 Difference]: With dead ends: 292 [2020-02-10 20:13:56,469 INFO L226 Difference]: Without dead ends: 279 [2020-02-10 20:13:56,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-02-10 20:13:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 182. [2020-02-10 20:13:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-02-10 20:13:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 526 transitions. [2020-02-10 20:13:56,473 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 526 transitions. Word has length 19 [2020-02-10 20:13:56,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:56,473 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 526 transitions. [2020-02-10 20:13:56,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:56,473 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 526 transitions. [2020-02-10 20:13:56,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:56,473 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:56,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:56,474 INFO L427 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:56,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:56,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1408327434, now seen corresponding path program 377 times [2020-02-10 20:13:56,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:56,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523871793] [2020-02-10 20:13:56,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:56,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523871793] [2020-02-10 20:13:56,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:56,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:56,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863556030] [2020-02-10 20:13:56,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:56,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:56,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:56,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:56,681 INFO L87 Difference]: Start difference. First operand 182 states and 526 transitions. Second operand 8 states. [2020-02-10 20:13:56,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:56,759 INFO L93 Difference]: Finished difference Result 284 states and 686 transitions. [2020-02-10 20:13:56,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:56,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:56,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:56,760 INFO L225 Difference]: With dead ends: 284 [2020-02-10 20:13:56,760 INFO L226 Difference]: Without dead ends: 274 [2020-02-10 20:13:56,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:56,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-02-10 20:13:56,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-02-10 20:13:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-02-10 20:13:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 527 transitions. [2020-02-10 20:13:56,764 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 527 transitions. Word has length 19 [2020-02-10 20:13:56,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:56,764 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 527 transitions. [2020-02-10 20:13:56,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 527 transitions. [2020-02-10 20:13:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:56,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:56,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:56,765 INFO L427 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:56,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:56,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1168685096, now seen corresponding path program 378 times [2020-02-10 20:13:56,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:56,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120433152] [2020-02-10 20:13:56,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:56,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120433152] [2020-02-10 20:13:56,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:56,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:56,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260958825] [2020-02-10 20:13:56,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:56,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:56,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:56,979 INFO L87 Difference]: Start difference. First operand 183 states and 527 transitions. Second operand 8 states. [2020-02-10 20:13:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:57,038 INFO L93 Difference]: Finished difference Result 284 states and 685 transitions. [2020-02-10 20:13:57,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:57,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:57,039 INFO L225 Difference]: With dead ends: 284 [2020-02-10 20:13:57,039 INFO L226 Difference]: Without dead ends: 271 [2020-02-10 20:13:57,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-02-10 20:13:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 180. [2020-02-10 20:13:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 20:13:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 522 transitions. [2020-02-10 20:13:57,043 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 522 transitions. Word has length 19 [2020-02-10 20:13:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:57,043 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 522 transitions. [2020-02-10 20:13:57,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 522 transitions. [2020-02-10 20:13:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:57,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:57,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:57,044 INFO L427 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:57,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1264971302, now seen corresponding path program 379 times [2020-02-10 20:13:57,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:57,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393020683] [2020-02-10 20:13:57,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:57,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:13:57,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393020683] [2020-02-10 20:13:57,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:57,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:57,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642821148] [2020-02-10 20:13:57,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:57,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:57,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:57,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:57,241 INFO L87 Difference]: Start difference. First operand 180 states and 522 transitions. Second operand 8 states. [2020-02-10 20:13:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:57,325 INFO L93 Difference]: Finished difference Result 288 states and 699 transitions. [2020-02-10 20:13:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:57,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:57,327 INFO L225 Difference]: With dead ends: 288 [2020-02-10 20:13:57,327 INFO L226 Difference]: Without dead ends: 274 [2020-02-10 20:13:57,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-02-10 20:13:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-02-10 20:13:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-02-10 20:13:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 528 transitions. [2020-02-10 20:13:57,331 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 528 transitions. Word has length 19 [2020-02-10 20:13:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:57,331 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 528 transitions. [2020-02-10 20:13:57,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 528 transitions. [2020-02-10 20:13:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:57,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:57,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:57,332 INFO L427 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:57,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:57,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2139306628, now seen corresponding path program 380 times [2020-02-10 20:13:57,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:57,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641223516] [2020-02-10 20:13:57,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:57,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641223516] [2020-02-10 20:13:57,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:57,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:57,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394212722] [2020-02-10 20:13:57,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:57,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:57,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:57,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:57,542 INFO L87 Difference]: Start difference. First operand 183 states and 528 transitions. Second operand 8 states. [2020-02-10 20:13:57,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:57,618 INFO L93 Difference]: Finished difference Result 284 states and 688 transitions. [2020-02-10 20:13:57,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:57,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:57,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:57,620 INFO L225 Difference]: With dead ends: 284 [2020-02-10 20:13:57,620 INFO L226 Difference]: Without dead ends: 272 [2020-02-10 20:13:57,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-02-10 20:13:57,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 181. [2020-02-10 20:13:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-02-10 20:13:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 524 transitions. [2020-02-10 20:13:57,624 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 524 transitions. Word has length 19 [2020-02-10 20:13:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:57,625 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 524 transitions. [2020-02-10 20:13:57,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 524 transitions. [2020-02-10 20:13:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:57,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:57,626 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:57,626 INFO L427 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:57,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:57,626 INFO L82 PathProgramCache]: Analyzing trace with hash -103949188, now seen corresponding path program 381 times [2020-02-10 20:13:57,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:57,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796798369] [2020-02-10 20:13:57,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:57,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796798369] [2020-02-10 20:13:57,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:57,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:57,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568055004] [2020-02-10 20:13:57,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:57,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:57,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:57,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:57,831 INFO L87 Difference]: Start difference. First operand 181 states and 524 transitions. Second operand 8 states. [2020-02-10 20:13:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:57,902 INFO L93 Difference]: Finished difference Result 288 states and 698 transitions. [2020-02-10 20:13:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:57,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:57,903 INFO L225 Difference]: With dead ends: 288 [2020-02-10 20:13:57,903 INFO L226 Difference]: Without dead ends: 274 [2020-02-10 20:13:57,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:57,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-02-10 20:13:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-02-10 20:13:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-02-10 20:13:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 527 transitions. [2020-02-10 20:13:57,908 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 527 transitions. Word has length 19 [2020-02-10 20:13:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:57,908 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 527 transitions. [2020-02-10 20:13:57,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 527 transitions. [2020-02-10 20:13:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:57,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:57,908 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:57,909 INFO L427 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:57,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1016180642, now seen corresponding path program 382 times [2020-02-10 20:13:57,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:57,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507267534] [2020-02-10 20:13:57,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:58,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507267534] [2020-02-10 20:13:58,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:58,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:58,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422392620] [2020-02-10 20:13:58,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:58,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:58,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:58,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:58,116 INFO L87 Difference]: Start difference. First operand 183 states and 527 transitions. Second operand 8 states. [2020-02-10 20:13:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:58,176 INFO L93 Difference]: Finished difference Result 284 states and 687 transitions. [2020-02-10 20:13:58,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:58,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:58,178 INFO L225 Difference]: With dead ends: 284 [2020-02-10 20:13:58,178 INFO L226 Difference]: Without dead ends: 272 [2020-02-10 20:13:58,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-02-10 20:13:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 181. [2020-02-10 20:13:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-02-10 20:13:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 523 transitions. [2020-02-10 20:13:58,182 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 523 transitions. Word has length 19 [2020-02-10 20:13:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:58,182 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 523 transitions. [2020-02-10 20:13:58,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 523 transitions. [2020-02-10 20:13:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:58,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:58,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:58,182 INFO L427 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:58,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:58,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1793678558, now seen corresponding path program 383 times [2020-02-10 20:13:58,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:58,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329646978] [2020-02-10 20:13:58,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:58,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329646978] [2020-02-10 20:13:58,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:58,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:58,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329497800] [2020-02-10 20:13:58,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:58,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:58,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:58,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:58,393 INFO L87 Difference]: Start difference. First operand 181 states and 523 transitions. Second operand 8 states. [2020-02-10 20:13:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:58,475 INFO L93 Difference]: Finished difference Result 279 states and 676 transitions. [2020-02-10 20:13:58,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:58,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:58,476 INFO L225 Difference]: With dead ends: 279 [2020-02-10 20:13:58,476 INFO L226 Difference]: Without dead ends: 269 [2020-02-10 20:13:58,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-02-10 20:13:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 182. [2020-02-10 20:13:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-02-10 20:13:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 524 transitions. [2020-02-10 20:13:58,481 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 524 transitions. Word has length 19 [2020-02-10 20:13:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:58,481 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 524 transitions. [2020-02-10 20:13:58,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 524 transitions. [2020-02-10 20:13:58,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:58,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:58,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:58,481 INFO L427 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:58,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:58,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1554036220, now seen corresponding path program 384 times [2020-02-10 20:13:58,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:58,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082695333] [2020-02-10 20:13:58,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:58,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082695333] [2020-02-10 20:13:58,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:58,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:58,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476353110] [2020-02-10 20:13:58,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:58,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:58,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:58,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:58,702 INFO L87 Difference]: Start difference. First operand 182 states and 524 transitions. Second operand 8 states. [2020-02-10 20:13:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:58,770 INFO L93 Difference]: Finished difference Result 279 states and 675 transitions. [2020-02-10 20:13:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:58,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:58,772 INFO L225 Difference]: With dead ends: 279 [2020-02-10 20:13:58,772 INFO L226 Difference]: Without dead ends: 264 [2020-02-10 20:13:58,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-02-10 20:13:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 177. [2020-02-10 20:13:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 20:13:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 516 transitions. [2020-02-10 20:13:58,776 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 516 transitions. Word has length 19 [2020-02-10 20:13:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:58,776 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 516 transitions. [2020-02-10 20:13:58,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 516 transitions. [2020-02-10 20:13:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:58,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:58,777 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:58,777 INFO L427 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:58,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:58,777 INFO L82 PathProgramCache]: Analyzing trace with hash 22174086, now seen corresponding path program 385 times [2020-02-10 20:13:58,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:58,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936374099] [2020-02-10 20:13:58,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:58,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936374099] [2020-02-10 20:13:58,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:58,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:58,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019487090] [2020-02-10 20:13:58,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:58,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:58,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:58,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:58,979 INFO L87 Difference]: Start difference. First operand 177 states and 516 transitions. Second operand 8 states. [2020-02-10 20:13:59,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:59,037 INFO L93 Difference]: Finished difference Result 321 states and 784 transitions. [2020-02-10 20:13:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:59,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:59,038 INFO L225 Difference]: With dead ends: 321 [2020-02-10 20:13:59,038 INFO L226 Difference]: Without dead ends: 305 [2020-02-10 20:13:59,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-02-10 20:13:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 185. [2020-02-10 20:13:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 20:13:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 530 transitions. [2020-02-10 20:13:59,042 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 530 transitions. Word has length 19 [2020-02-10 20:13:59,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:59,043 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 530 transitions. [2020-02-10 20:13:59,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 530 transitions. [2020-02-10 20:13:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:59,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:59,043 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:59,043 INFO L427 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:59,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:59,044 INFO L82 PathProgramCache]: Analyzing trace with hash 396825272, now seen corresponding path program 386 times [2020-02-10 20:13:59,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:59,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824153348] [2020-02-10 20:13:59,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:59,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824153348] [2020-02-10 20:13:59,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:59,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:59,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911746257] [2020-02-10 20:13:59,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:59,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:59,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:59,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:59,237 INFO L87 Difference]: Start difference. First operand 185 states and 530 transitions. Second operand 8 states. [2020-02-10 20:13:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:59,317 INFO L93 Difference]: Finished difference Result 319 states and 774 transitions. [2020-02-10 20:13:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:59,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:59,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:59,318 INFO L225 Difference]: With dead ends: 319 [2020-02-10 20:13:59,318 INFO L226 Difference]: Without dead ends: 297 [2020-02-10 20:13:59,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:59,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-02-10 20:13:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 177. [2020-02-10 20:13:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 20:13:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 512 transitions. [2020-02-10 20:13:59,322 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 512 transitions. Word has length 19 [2020-02-10 20:13:59,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:59,323 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 512 transitions. [2020-02-10 20:13:59,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 512 transitions. [2020-02-10 20:13:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:59,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:59,323 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:59,323 INFO L427 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:59,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:59,323 INFO L82 PathProgramCache]: Analyzing trace with hash 226775168, now seen corresponding path program 387 times [2020-02-10 20:13:59,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:59,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36567594] [2020-02-10 20:13:59,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:59,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36567594] [2020-02-10 20:13:59,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:59,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:59,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780896159] [2020-02-10 20:13:59,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:59,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:59,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:59,511 INFO L87 Difference]: Start difference. First operand 177 states and 512 transitions. Second operand 8 states. [2020-02-10 20:13:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:59,566 INFO L93 Difference]: Finished difference Result 312 states and 757 transitions. [2020-02-10 20:13:59,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:59,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:59,567 INFO L225 Difference]: With dead ends: 312 [2020-02-10 20:13:59,567 INFO L226 Difference]: Without dead ends: 296 [2020-02-10 20:13:59,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-02-10 20:13:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 180. [2020-02-10 20:13:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 20:13:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 516 transitions. [2020-02-10 20:13:59,572 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 516 transitions. Word has length 19 [2020-02-10 20:13:59,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:59,572 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 516 transitions. [2020-02-10 20:13:59,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 516 transitions. [2020-02-10 20:13:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:59,573 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:59,573 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:59,573 INFO L427 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:59,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:59,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1924951378, now seen corresponding path program 388 times [2020-02-10 20:13:59,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:59,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574692886] [2020-02-10 20:13:59,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:59,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574692886] [2020-02-10 20:13:59,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:59,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:13:59,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714159158] [2020-02-10 20:13:59,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:13:59,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:59,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:13:59,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:13:59,762 INFO L87 Difference]: Start difference. First operand 180 states and 516 transitions. Second operand 8 states. [2020-02-10 20:13:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:59,841 INFO L93 Difference]: Finished difference Result 306 states and 742 transitions. [2020-02-10 20:13:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:13:59,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:13:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:59,843 INFO L225 Difference]: With dead ends: 306 [2020-02-10 20:13:59,843 INFO L226 Difference]: Without dead ends: 293 [2020-02-10 20:13:59,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:13:59,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-02-10 20:13:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 177. [2020-02-10 20:13:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 20:13:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 509 transitions. [2020-02-10 20:13:59,847 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 509 transitions. Word has length 19 [2020-02-10 20:13:59,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:59,848 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 509 transitions. [2020-02-10 20:13:59,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:13:59,848 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 509 transitions. [2020-02-10 20:13:59,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:13:59,848 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:59,848 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:59,848 INFO L427 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:59,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1171240866, now seen corresponding path program 389 times [2020-02-10 20:13:59,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:59,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774016417] [2020-02-10 20:13:59,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:00,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774016417] [2020-02-10 20:14:00,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:00,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:00,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505260535] [2020-02-10 20:14:00,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:00,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:00,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:00,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:00,036 INFO L87 Difference]: Start difference. First operand 177 states and 509 transitions. Second operand 8 states. [2020-02-10 20:14:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:00,111 INFO L93 Difference]: Finished difference Result 307 states and 746 transitions. [2020-02-10 20:14:00,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:00,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:00,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:00,113 INFO L225 Difference]: With dead ends: 307 [2020-02-10 20:14:00,113 INFO L226 Difference]: Without dead ends: 293 [2020-02-10 20:14:00,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-02-10 20:14:00,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 179. [2020-02-10 20:14:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 20:14:00,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 512 transitions. [2020-02-10 20:14:00,118 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 512 transitions. Word has length 19 [2020-02-10 20:14:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:00,118 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 512 transitions. [2020-02-10 20:14:00,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:00,118 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 512 transitions. [2020-02-10 20:14:00,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:00,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:00,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:00,118 INFO L427 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:00,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:00,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2045576192, now seen corresponding path program 390 times [2020-02-10 20:14:00,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:00,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576987526] [2020-02-10 20:14:00,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:00,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576987526] [2020-02-10 20:14:00,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:00,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:00,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390780718] [2020-02-10 20:14:00,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:00,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:00,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:00,307 INFO L87 Difference]: Start difference. First operand 179 states and 512 transitions. Second operand 8 states. [2020-02-10 20:14:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:00,390 INFO L93 Difference]: Finished difference Result 303 states and 735 transitions. [2020-02-10 20:14:00,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:00,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:00,391 INFO L225 Difference]: With dead ends: 303 [2020-02-10 20:14:00,391 INFO L226 Difference]: Without dead ends: 287 [2020-02-10 20:14:00,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-02-10 20:14:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 173. [2020-02-10 20:14:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-02-10 20:14:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 500 transitions. [2020-02-10 20:14:00,395 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 500 transitions. Word has length 19 [2020-02-10 20:14:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:00,395 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 500 transitions. [2020-02-10 20:14:00,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 500 transitions. [2020-02-10 20:14:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:00,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:00,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:00,396 INFO L427 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:00,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:00,396 INFO L82 PathProgramCache]: Analyzing trace with hash -822797366, now seen corresponding path program 391 times [2020-02-10 20:14:00,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:00,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349038406] [2020-02-10 20:14:00,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:00,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349038406] [2020-02-10 20:14:00,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:00,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:00,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618676390] [2020-02-10 20:14:00,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:00,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:00,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:00,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:00,604 INFO L87 Difference]: Start difference. First operand 173 states and 500 transitions. Second operand 8 states. [2020-02-10 20:14:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:00,662 INFO L93 Difference]: Finished difference Result 321 states and 787 transitions. [2020-02-10 20:14:00,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:00,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:00,663 INFO L225 Difference]: With dead ends: 321 [2020-02-10 20:14:00,664 INFO L226 Difference]: Without dead ends: 305 [2020-02-10 20:14:00,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:00,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-02-10 20:14:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 187. [2020-02-10 20:14:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 20:14:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 535 transitions. [2020-02-10 20:14:00,668 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 535 transitions. Word has length 19 [2020-02-10 20:14:00,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:00,668 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 535 transitions. [2020-02-10 20:14:00,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 535 transitions. [2020-02-10 20:14:00,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:00,669 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:00,669 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:00,669 INFO L427 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash -448146180, now seen corresponding path program 392 times [2020-02-10 20:14:00,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:00,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148914497] [2020-02-10 20:14:00,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:00,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148914497] [2020-02-10 20:14:00,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:00,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:00,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142124824] [2020-02-10 20:14:00,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:00,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:00,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:00,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:00,866 INFO L87 Difference]: Start difference. First operand 187 states and 535 transitions. Second operand 8 states. [2020-02-10 20:14:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:00,940 INFO L93 Difference]: Finished difference Result 319 states and 777 transitions. [2020-02-10 20:14:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:00,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:00,942 INFO L225 Difference]: With dead ends: 319 [2020-02-10 20:14:00,942 INFO L226 Difference]: Without dead ends: 297 [2020-02-10 20:14:00,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-02-10 20:14:00,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 179. [2020-02-10 20:14:00,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 20:14:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 515 transitions. [2020-02-10 20:14:00,946 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 515 transitions. Word has length 19 [2020-02-10 20:14:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:00,946 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 515 transitions. [2020-02-10 20:14:00,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 515 transitions. [2020-02-10 20:14:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:00,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:00,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:00,947 INFO L427 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:00,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:00,947 INFO L82 PathProgramCache]: Analyzing trace with hash 32996164, now seen corresponding path program 393 times [2020-02-10 20:14:00,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:00,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582277590] [2020-02-10 20:14:00,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:01,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582277590] [2020-02-10 20:14:01,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:01,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:01,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492082246] [2020-02-10 20:14:01,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:01,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:01,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:01,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:01,156 INFO L87 Difference]: Start difference. First operand 179 states and 515 transitions. Second operand 8 states. [2020-02-10 20:14:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:01,219 INFO L93 Difference]: Finished difference Result 308 states and 755 transitions. [2020-02-10 20:14:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:01,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:01,221 INFO L225 Difference]: With dead ends: 308 [2020-02-10 20:14:01,221 INFO L226 Difference]: Without dead ends: 292 [2020-02-10 20:14:01,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-02-10 20:14:01,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 184. [2020-02-10 20:14:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 20:14:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 524 transitions. [2020-02-10 20:14:01,225 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 524 transitions. Word has length 19 [2020-02-10 20:14:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:01,226 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 524 transitions. [2020-02-10 20:14:01,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 524 transitions. [2020-02-10 20:14:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:01,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:01,226 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:01,226 INFO L427 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:01,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:01,227 INFO L82 PathProgramCache]: Analyzing trace with hash -718065930, now seen corresponding path program 394 times [2020-02-10 20:14:01,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:01,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089962961] [2020-02-10 20:14:01,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:01,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:14:01,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089962961] [2020-02-10 20:14:01,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:01,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:01,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144239697] [2020-02-10 20:14:01,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:01,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:01,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:01,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:01,432 INFO L87 Difference]: Start difference. First operand 184 states and 524 transitions. Second operand 8 states. [2020-02-10 20:14:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:01,512 INFO L93 Difference]: Finished difference Result 295 states and 734 transitions. [2020-02-10 20:14:01,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:01,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:01,513 INFO L225 Difference]: With dead ends: 295 [2020-02-10 20:14:01,513 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 20:14:01,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 20:14:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 179. [2020-02-10 20:14:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 20:14:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 510 transitions. [2020-02-10 20:14:01,518 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 510 transitions. Word has length 19 [2020-02-10 20:14:01,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:01,518 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 510 transitions. [2020-02-10 20:14:01,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:01,518 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 510 transitions. [2020-02-10 20:14:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:01,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:01,519 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:01,519 INFO L427 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:01,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:01,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1988186406, now seen corresponding path program 395 times [2020-02-10 20:14:01,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:01,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717156832] [2020-02-10 20:14:01,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:01,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717156832] [2020-02-10 20:14:01,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:01,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:01,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867158989] [2020-02-10 20:14:01,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:01,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:01,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:01,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:01,718 INFO L87 Difference]: Start difference. First operand 179 states and 510 transitions. Second operand 8 states. [2020-02-10 20:14:01,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:01,797 INFO L93 Difference]: Finished difference Result 305 states and 745 transitions. [2020-02-10 20:14:01,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:01,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:01,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:01,798 INFO L225 Difference]: With dead ends: 305 [2020-02-10 20:14:01,798 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 20:14:01,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:01,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 20:14:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 183. [2020-02-10 20:14:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-02-10 20:14:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 518 transitions. [2020-02-10 20:14:01,803 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 518 transitions. Word has length 19 [2020-02-10 20:14:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:01,803 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 518 transitions. [2020-02-10 20:14:01,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:01,803 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 518 transitions. [2020-02-10 20:14:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:01,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:01,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:01,804 INFO L427 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1988781052, now seen corresponding path program 396 times [2020-02-10 20:14:01,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:01,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74637198] [2020-02-10 20:14:01,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:01,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:14:01,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74637198] [2020-02-10 20:14:01,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:01,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:01,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862174594] [2020-02-10 20:14:01,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:01,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:01,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:01,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:01,991 INFO L87 Difference]: Start difference. First operand 183 states and 518 transitions. Second operand 8 states. [2020-02-10 20:14:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:02,068 INFO L93 Difference]: Finished difference Result 294 states and 728 transitions. [2020-02-10 20:14:02,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:02,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:02,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:02,069 INFO L225 Difference]: With dead ends: 294 [2020-02-10 20:14:02,070 INFO L226 Difference]: Without dead ends: 272 [2020-02-10 20:14:02,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-02-10 20:14:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 173. [2020-02-10 20:14:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-02-10 20:14:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 496 transitions. [2020-02-10 20:14:02,074 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 496 transitions. Word has length 19 [2020-02-10 20:14:02,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:02,074 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 496 transitions. [2020-02-10 20:14:02,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 496 transitions. [2020-02-10 20:14:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:02,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:02,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:02,075 INFO L427 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:02,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:02,075 INFO L82 PathProgramCache]: Analyzing trace with hash 986570822, now seen corresponding path program 397 times [2020-02-10 20:14:02,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:02,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771994206] [2020-02-10 20:14:02,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:02,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771994206] [2020-02-10 20:14:02,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:02,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:02,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490681171] [2020-02-10 20:14:02,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:02,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:02,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:02,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:02,267 INFO L87 Difference]: Start difference. First operand 173 states and 496 transitions. Second operand 8 states. [2020-02-10 20:14:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:02,324 INFO L93 Difference]: Finished difference Result 303 states and 733 transitions. [2020-02-10 20:14:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:02,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:02,325 INFO L225 Difference]: With dead ends: 303 [2020-02-10 20:14:02,325 INFO L226 Difference]: Without dead ends: 287 [2020-02-10 20:14:02,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-02-10 20:14:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 179. [2020-02-10 20:14:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 20:14:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 510 transitions. [2020-02-10 20:14:02,330 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 510 transitions. Word has length 19 [2020-02-10 20:14:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:02,330 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 510 transitions. [2020-02-10 20:14:02,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 510 transitions. [2020-02-10 20:14:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:02,330 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:02,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:02,330 INFO L427 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:02,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1165155724, now seen corresponding path program 398 times [2020-02-10 20:14:02,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:02,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136448961] [2020-02-10 20:14:02,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:02,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136448961] [2020-02-10 20:14:02,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:02,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:02,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473891598] [2020-02-10 20:14:02,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:02,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:02,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:02,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:02,535 INFO L87 Difference]: Start difference. First operand 179 states and 510 transitions. Second operand 8 states. [2020-02-10 20:14:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:02,619 INFO L93 Difference]: Finished difference Result 297 states and 718 transitions. [2020-02-10 20:14:02,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:02,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:02,620 INFO L225 Difference]: With dead ends: 297 [2020-02-10 20:14:02,621 INFO L226 Difference]: Without dead ends: 284 [2020-02-10 20:14:02,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-02-10 20:14:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 176. [2020-02-10 20:14:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-02-10 20:14:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 503 transitions. [2020-02-10 20:14:02,625 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 503 transitions. Word has length 19 [2020-02-10 20:14:02,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:02,625 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 503 transitions. [2020-02-10 20:14:02,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 503 transitions. [2020-02-10 20:14:02,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:02,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:02,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:02,625 INFO L427 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:02,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:02,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2080662410, now seen corresponding path program 399 times [2020-02-10 20:14:02,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:02,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833428630] [2020-02-10 20:14:02,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:02,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833428630] [2020-02-10 20:14:02,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:02,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:02,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275000853] [2020-02-10 20:14:02,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:02,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:02,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:02,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:02,853 INFO L87 Difference]: Start difference. First operand 176 states and 503 transitions. Second operand 8 states. [2020-02-10 20:14:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:02,910 INFO L93 Difference]: Finished difference Result 299 states and 727 transitions. [2020-02-10 20:14:02,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:02,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:02,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:02,911 INFO L225 Difference]: With dead ends: 299 [2020-02-10 20:14:02,912 INFO L226 Difference]: Without dead ends: 283 [2020-02-10 20:14:02,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-02-10 20:14:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 181. [2020-02-10 20:14:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-02-10 20:14:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 512 transitions. [2020-02-10 20:14:02,916 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 512 transitions. Word has length 19 [2020-02-10 20:14:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:02,916 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 512 transitions. [2020-02-10 20:14:02,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 512 transitions. [2020-02-10 20:14:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:02,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:02,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:02,917 INFO L427 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:02,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:02,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1329600316, now seen corresponding path program 400 times [2020-02-10 20:14:02,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:02,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130368633] [2020-02-10 20:14:02,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:03,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130368633] [2020-02-10 20:14:03,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:03,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:03,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366270946] [2020-02-10 20:14:03,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:03,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:03,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:03,109 INFO L87 Difference]: Start difference. First operand 181 states and 512 transitions. Second operand 8 states. [2020-02-10 20:14:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:03,191 INFO L93 Difference]: Finished difference Result 286 states and 706 transitions. [2020-02-10 20:14:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:03,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:03,192 INFO L225 Difference]: With dead ends: 286 [2020-02-10 20:14:03,192 INFO L226 Difference]: Without dead ends: 269 [2020-02-10 20:14:03,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:03,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-02-10 20:14:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 176. [2020-02-10 20:14:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-02-10 20:14:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 500 transitions. [2020-02-10 20:14:03,197 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 500 transitions. Word has length 19 [2020-02-10 20:14:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:03,197 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 500 transitions. [2020-02-10 20:14:03,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 500 transitions. [2020-02-10 20:14:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:03,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:03,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:03,198 INFO L427 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:03,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:03,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1804719824, now seen corresponding path program 401 times [2020-02-10 20:14:03,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:03,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343198799] [2020-02-10 20:14:03,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:03,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343198799] [2020-02-10 20:14:03,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:03,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:03,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144426933] [2020-02-10 20:14:03,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:03,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:03,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:03,390 INFO L87 Difference]: Start difference. First operand 176 states and 500 transitions. Second operand 8 states. [2020-02-10 20:14:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:03,463 INFO L93 Difference]: Finished difference Result 290 states and 703 transitions. [2020-02-10 20:14:03,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:03,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:03,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:03,464 INFO L225 Difference]: With dead ends: 290 [2020-02-10 20:14:03,464 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 20:14:03,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:03,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 20:14:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 178. [2020-02-10 20:14:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-02-10 20:14:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 503 transitions. [2020-02-10 20:14:03,468 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 503 transitions. Word has length 19 [2020-02-10 20:14:03,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:03,469 INFO L479 AbstractCegarLoop]: Abstraction has 178 states and 503 transitions. [2020-02-10 20:14:03,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 503 transitions. [2020-02-10 20:14:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:03,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:03,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:03,469 INFO L427 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:03,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:03,469 INFO L82 PathProgramCache]: Analyzing trace with hash -94106516, now seen corresponding path program 402 times [2020-02-10 20:14:03,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:03,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564137132] [2020-02-10 20:14:03,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:03,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564137132] [2020-02-10 20:14:03,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:03,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:03,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888577383] [2020-02-10 20:14:03,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:03,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:03,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:03,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:03,665 INFO L87 Difference]: Start difference. First operand 178 states and 503 transitions. Second operand 8 states. [2020-02-10 20:14:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:03,738 INFO L93 Difference]: Finished difference Result 283 states and 697 transitions. [2020-02-10 20:14:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:03,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:03,739 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:14:03,739 INFO L226 Difference]: Without dead ends: 266 [2020-02-10 20:14:03,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-02-10 20:14:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 173. [2020-02-10 20:14:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-02-10 20:14:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 493 transitions. [2020-02-10 20:14:03,743 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 493 transitions. Word has length 19 [2020-02-10 20:14:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:03,743 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 493 transitions. [2020-02-10 20:14:03,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 493 transitions. [2020-02-10 20:14:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:03,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:03,744 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:03,744 INFO L427 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:03,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:03,744 INFO L82 PathProgramCache]: Analyzing trace with hash 196668370, now seen corresponding path program 403 times [2020-02-10 20:14:03,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:03,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336077911] [2020-02-10 20:14:03,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:03,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336077911] [2020-02-10 20:14:03,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:03,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:03,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757682855] [2020-02-10 20:14:03,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:03,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:03,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:03,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:03,920 INFO L87 Difference]: Start difference. First operand 173 states and 493 transitions. Second operand 8 states. [2020-02-10 20:14:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:03,996 INFO L93 Difference]: Finished difference Result 294 states and 714 transitions. [2020-02-10 20:14:03,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:03,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:03,998 INFO L225 Difference]: With dead ends: 294 [2020-02-10 20:14:03,998 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 20:14:03,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:03,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 20:14:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 177. [2020-02-10 20:14:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 20:14:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 503 transitions. [2020-02-10 20:14:04,002 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 503 transitions. Word has length 19 [2020-02-10 20:14:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:04,002 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 503 transitions. [2020-02-10 20:14:04,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 503 transitions. [2020-02-10 20:14:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:04,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:04,003 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:04,003 INFO L427 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:04,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:04,003 INFO L82 PathProgramCache]: Analyzing trace with hash -677666956, now seen corresponding path program 404 times [2020-02-10 20:14:04,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:04,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142907120] [2020-02-10 20:14:04,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:04,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:14:04,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142907120] [2020-02-10 20:14:04,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:04,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:04,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031311823] [2020-02-10 20:14:04,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:04,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:04,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:04,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:04,179 INFO L87 Difference]: Start difference. First operand 177 states and 503 transitions. Second operand 8 states. [2020-02-10 20:14:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:04,253 INFO L93 Difference]: Finished difference Result 290 states and 703 transitions. [2020-02-10 20:14:04,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:04,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:04,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:04,254 INFO L225 Difference]: With dead ends: 290 [2020-02-10 20:14:04,254 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 20:14:04,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 20:14:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 175. [2020-02-10 20:14:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-02-10 20:14:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 498 transitions. [2020-02-10 20:14:04,259 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 498 transitions. Word has length 19 [2020-02-10 20:14:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:04,259 INFO L479 AbstractCegarLoop]: Abstraction has 175 states and 498 transitions. [2020-02-10 20:14:04,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 498 transitions. [2020-02-10 20:14:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:04,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:04,259 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:04,259 INFO L427 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:04,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:04,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1686073366, now seen corresponding path program 405 times [2020-02-10 20:14:04,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:04,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110933201] [2020-02-10 20:14:04,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:04,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110933201] [2020-02-10 20:14:04,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:04,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:04,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102297655] [2020-02-10 20:14:04,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:04,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:04,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:04,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:04,431 INFO L87 Difference]: Start difference. First operand 175 states and 498 transitions. Second operand 8 states. [2020-02-10 20:14:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:04,506 INFO L93 Difference]: Finished difference Result 292 states and 712 transitions. [2020-02-10 20:14:04,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:04,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:04,507 INFO L225 Difference]: With dead ends: 292 [2020-02-10 20:14:04,507 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 20:14:04,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 20:14:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 179. [2020-02-10 20:14:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 20:14:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 506 transitions. [2020-02-10 20:14:04,512 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 506 transitions. Word has length 19 [2020-02-10 20:14:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:04,512 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 506 transitions. [2020-02-10 20:14:04,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 506 transitions. [2020-02-10 20:14:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:04,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:04,512 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:04,513 INFO L427 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:04,513 INFO L82 PathProgramCache]: Analyzing trace with hash 940776222, now seen corresponding path program 406 times [2020-02-10 20:14:04,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:04,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914177429] [2020-02-10 20:14:04,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:04,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914177429] [2020-02-10 20:14:04,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:04,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:04,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614646699] [2020-02-10 20:14:04,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:04,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:04,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:04,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:04,689 INFO L87 Difference]: Start difference. First operand 179 states and 506 transitions. Second operand 8 states. [2020-02-10 20:14:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:04,766 INFO L93 Difference]: Finished difference Result 281 states and 695 transitions. [2020-02-10 20:14:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:04,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:04,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:04,767 INFO L225 Difference]: With dead ends: 281 [2020-02-10 20:14:04,768 INFO L226 Difference]: Without dead ends: 265 [2020-02-10 20:14:04,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-02-10 20:14:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 175. [2020-02-10 20:14:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-02-10 20:14:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 496 transitions. [2020-02-10 20:14:04,772 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 496 transitions. Word has length 19 [2020-02-10 20:14:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:04,772 INFO L479 AbstractCegarLoop]: Abstraction has 175 states and 496 transitions. [2020-02-10 20:14:04,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:04,772 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 496 transitions. [2020-02-10 20:14:04,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:04,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:04,773 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:04,773 INFO L427 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:04,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:04,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1249121762, now seen corresponding path program 407 times [2020-02-10 20:14:04,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:04,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598573235] [2020-02-10 20:14:04,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:04,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598573235] [2020-02-10 20:14:04,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:04,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:04,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3546949] [2020-02-10 20:14:04,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:04,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:04,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:04,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:04,954 INFO L87 Difference]: Start difference. First operand 175 states and 496 transitions. Second operand 8 states. [2020-02-10 20:14:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:05,024 INFO L93 Difference]: Finished difference Result 286 states and 694 transitions. [2020-02-10 20:14:05,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:05,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:05,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:05,025 INFO L225 Difference]: With dead ends: 286 [2020-02-10 20:14:05,025 INFO L226 Difference]: Without dead ends: 276 [2020-02-10 20:14:05,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:05,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-02-10 20:14:05,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 177. [2020-02-10 20:14:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 20:14:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 499 transitions. [2020-02-10 20:14:05,029 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 499 transitions. Word has length 19 [2020-02-10 20:14:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:05,029 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 499 transitions. [2020-02-10 20:14:05,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 499 transitions. [2020-02-10 20:14:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:05,030 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:05,030 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:05,030 INFO L427 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:05,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash 461491546, now seen corresponding path program 408 times [2020-02-10 20:14:05,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:05,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493803403] [2020-02-10 20:14:05,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:05,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493803403] [2020-02-10 20:14:05,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:05,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:05,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612652461] [2020-02-10 20:14:05,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:05,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:05,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:05,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:05,212 INFO L87 Difference]: Start difference. First operand 177 states and 499 transitions. Second operand 8 states. [2020-02-10 20:14:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:05,301 INFO L93 Difference]: Finished difference Result 279 states and 688 transitions. [2020-02-10 20:14:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:05,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:05,302 INFO L225 Difference]: With dead ends: 279 [2020-02-10 20:14:05,302 INFO L226 Difference]: Without dead ends: 259 [2020-02-10 20:14:05,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:05,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-02-10 20:14:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 169. [2020-02-10 20:14:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-02-10 20:14:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 485 transitions. [2020-02-10 20:14:05,305 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 485 transitions. Word has length 19 [2020-02-10 20:14:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:05,306 INFO L479 AbstractCegarLoop]: Abstraction has 169 states and 485 transitions. [2020-02-10 20:14:05,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 485 transitions. [2020-02-10 20:14:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:05,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:05,306 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:05,306 INFO L427 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:05,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:05,306 INFO L82 PathProgramCache]: Analyzing trace with hash -612467258, now seen corresponding path program 409 times [2020-02-10 20:14:05,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:05,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970116335] [2020-02-10 20:14:05,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:05,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970116335] [2020-02-10 20:14:05,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:05,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:05,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309095805] [2020-02-10 20:14:05,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:05,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:05,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:05,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:05,510 INFO L87 Difference]: Start difference. First operand 169 states and 485 transitions. Second operand 8 states. [2020-02-10 20:14:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:05,565 INFO L93 Difference]: Finished difference Result 305 states and 732 transitions. [2020-02-10 20:14:05,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:05,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:05,566 INFO L225 Difference]: With dead ends: 305 [2020-02-10 20:14:05,566 INFO L226 Difference]: Without dead ends: 289 [2020-02-10 20:14:05,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-02-10 20:14:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 177. [2020-02-10 20:14:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 20:14:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 499 transitions. [2020-02-10 20:14:05,570 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 499 transitions. Word has length 19 [2020-02-10 20:14:05,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:05,571 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 499 transitions. [2020-02-10 20:14:05,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 499 transitions. [2020-02-10 20:14:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:05,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:05,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:05,571 INFO L427 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:05,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:05,571 INFO L82 PathProgramCache]: Analyzing trace with hash -237816072, now seen corresponding path program 410 times [2020-02-10 20:14:05,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:05,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092482512] [2020-02-10 20:14:05,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:05,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092482512] [2020-02-10 20:14:05,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:05,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:05,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891937428] [2020-02-10 20:14:05,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:05,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:05,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:05,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:05,769 INFO L87 Difference]: Start difference. First operand 177 states and 499 transitions. Second operand 8 states. [2020-02-10 20:14:05,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:05,847 INFO L93 Difference]: Finished difference Result 303 states and 722 transitions. [2020-02-10 20:14:05,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:05,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:05,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:05,848 INFO L225 Difference]: With dead ends: 303 [2020-02-10 20:14:05,848 INFO L226 Difference]: Without dead ends: 281 [2020-02-10 20:14:05,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:05,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-02-10 20:14:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 169. [2020-02-10 20:14:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-02-10 20:14:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 481 transitions. [2020-02-10 20:14:05,853 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 481 transitions. Word has length 19 [2020-02-10 20:14:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:05,853 INFO L479 AbstractCegarLoop]: Abstraction has 169 states and 481 transitions. [2020-02-10 20:14:05,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 481 transitions. [2020-02-10 20:14:05,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:05,853 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:05,853 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:05,853 INFO L427 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:05,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:05,854 INFO L82 PathProgramCache]: Analyzing trace with hash -82269952, now seen corresponding path program 411 times [2020-02-10 20:14:05,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:05,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392456734] [2020-02-10 20:14:05,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:06,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392456734] [2020-02-10 20:14:06,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:06,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:06,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842546910] [2020-02-10 20:14:06,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:06,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:06,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:06,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:06,044 INFO L87 Difference]: Start difference. First operand 169 states and 481 transitions. Second operand 8 states. [2020-02-10 20:14:06,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:06,099 INFO L93 Difference]: Finished difference Result 296 states and 705 transitions. [2020-02-10 20:14:06,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:06,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:06,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:06,100 INFO L225 Difference]: With dead ends: 296 [2020-02-10 20:14:06,101 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 20:14:06,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 20:14:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 172. [2020-02-10 20:14:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-02-10 20:14:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 485 transitions. [2020-02-10 20:14:06,104 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 485 transitions. Word has length 19 [2020-02-10 20:14:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:06,105 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 485 transitions. [2020-02-10 20:14:06,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 485 transitions. [2020-02-10 20:14:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:06,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:06,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:06,105 INFO L427 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:06,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:06,105 INFO L82 PathProgramCache]: Analyzing trace with hash 176788274, now seen corresponding path program 412 times [2020-02-10 20:14:06,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:06,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21020239] [2020-02-10 20:14:06,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:06,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21020239] [2020-02-10 20:14:06,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:06,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:06,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181809800] [2020-02-10 20:14:06,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:06,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:06,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:06,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:06,299 INFO L87 Difference]: Start difference. First operand 172 states and 485 transitions. Second operand 8 states. [2020-02-10 20:14:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:06,357 INFO L93 Difference]: Finished difference Result 290 states and 690 transitions. [2020-02-10 20:14:06,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:06,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:06,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:06,358 INFO L225 Difference]: With dead ends: 290 [2020-02-10 20:14:06,358 INFO L226 Difference]: Without dead ends: 277 [2020-02-10 20:14:06,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:06,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-02-10 20:14:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 169. [2020-02-10 20:14:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-02-10 20:14:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 478 transitions. [2020-02-10 20:14:06,362 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 478 transitions. Word has length 19 [2020-02-10 20:14:06,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:06,362 INFO L479 AbstractCegarLoop]: Abstraction has 169 states and 478 transitions. [2020-02-10 20:14:06,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:06,362 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 478 transitions. [2020-02-10 20:14:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:06,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:06,362 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:06,362 INFO L427 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:06,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1840035768, now seen corresponding path program 413 times [2020-02-10 20:14:06,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:06,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420447807] [2020-02-10 20:14:06,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:06,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420447807] [2020-02-10 20:14:06,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:06,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:06,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670008455] [2020-02-10 20:14:06,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:06,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:06,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:06,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:06,549 INFO L87 Difference]: Start difference. First operand 169 states and 478 transitions. Second operand 8 states. [2020-02-10 20:14:06,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:06,620 INFO L93 Difference]: Finished difference Result 291 states and 694 transitions. [2020-02-10 20:14:06,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:06,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:06,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:06,621 INFO L225 Difference]: With dead ends: 291 [2020-02-10 20:14:06,621 INFO L226 Difference]: Without dead ends: 277 [2020-02-10 20:14:06,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-02-10 20:14:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 171. [2020-02-10 20:14:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-02-10 20:14:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 481 transitions. [2020-02-10 20:14:06,626 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 481 transitions. Word has length 19 [2020-02-10 20:14:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:06,626 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 481 transitions. [2020-02-10 20:14:06,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 481 transitions. [2020-02-10 20:14:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:06,626 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:06,626 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:06,626 INFO L427 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:06,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1334801698, now seen corresponding path program 414 times [2020-02-10 20:14:06,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:06,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524574481] [2020-02-10 20:14:06,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:06,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524574481] [2020-02-10 20:14:06,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:06,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:06,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073245439] [2020-02-10 20:14:06,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:06,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:06,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:06,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:06,819 INFO L87 Difference]: Start difference. First operand 171 states and 481 transitions. Second operand 8 states. [2020-02-10 20:14:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:06,875 INFO L93 Difference]: Finished difference Result 287 states and 683 transitions. [2020-02-10 20:14:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:06,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:06,876 INFO L225 Difference]: With dead ends: 287 [2020-02-10 20:14:06,876 INFO L226 Difference]: Without dead ends: 271 [2020-02-10 20:14:06,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-02-10 20:14:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 165. [2020-02-10 20:14:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-02-10 20:14:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 469 transitions. [2020-02-10 20:14:06,881 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 469 transitions. Word has length 19 [2020-02-10 20:14:06,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:06,881 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 469 transitions. [2020-02-10 20:14:06,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 469 transitions. [2020-02-10 20:14:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:06,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:06,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:06,882 INFO L427 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:06,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:06,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1034952984, now seen corresponding path program 415 times [2020-02-10 20:14:06,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:06,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000142068] [2020-02-10 20:14:06,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:07,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:14:07,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000142068] [2020-02-10 20:14:07,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:07,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:07,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472517826] [2020-02-10 20:14:07,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:07,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:07,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:07,082 INFO L87 Difference]: Start difference. First operand 165 states and 469 transitions. Second operand 8 states. [2020-02-10 20:14:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:07,137 INFO L93 Difference]: Finished difference Result 299 states and 714 transitions. [2020-02-10 20:14:07,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:07,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:07,138 INFO L225 Difference]: With dead ends: 299 [2020-02-10 20:14:07,138 INFO L226 Difference]: Without dead ends: 283 [2020-02-10 20:14:07,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-02-10 20:14:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 165. [2020-02-10 20:14:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-02-10 20:14:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 462 transitions. [2020-02-10 20:14:07,142 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 462 transitions. Word has length 19 [2020-02-10 20:14:07,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:07,142 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 462 transitions. [2020-02-10 20:14:07,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 462 transitions. [2020-02-10 20:14:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:07,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:07,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:07,143 INFO L427 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:07,143 INFO L82 PathProgramCache]: Analyzing trace with hash -660301798, now seen corresponding path program 416 times [2020-02-10 20:14:07,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:07,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327771418] [2020-02-10 20:14:07,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:07,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327771418] [2020-02-10 20:14:07,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:07,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:07,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624689953] [2020-02-10 20:14:07,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:07,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:07,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:07,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:07,342 INFO L87 Difference]: Start difference. First operand 165 states and 462 transitions. Second operand 8 states. [2020-02-10 20:14:07,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:07,415 INFO L93 Difference]: Finished difference Result 297 states and 704 transitions. [2020-02-10 20:14:07,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:07,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:07,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:07,416 INFO L225 Difference]: With dead ends: 297 [2020-02-10 20:14:07,416 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 20:14:07,417 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 20:14:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 157. [2020-02-10 20:14:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 20:14:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 442 transitions. [2020-02-10 20:14:07,424 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 442 transitions. Word has length 19 [2020-02-10 20:14:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:07,424 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 442 transitions. [2020-02-10 20:14:07,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 442 transitions. [2020-02-10 20:14:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:07,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:07,424 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:07,425 INFO L427 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:07,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:07,425 INFO L82 PathProgramCache]: Analyzing trace with hash -179159454, now seen corresponding path program 417 times [2020-02-10 20:14:07,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:07,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876728496] [2020-02-10 20:14:07,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:07,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876728496] [2020-02-10 20:14:07,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:07,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:07,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62928402] [2020-02-10 20:14:07,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:07,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:07,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:07,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:07,625 INFO L87 Difference]: Start difference. First operand 157 states and 442 transitions. Second operand 8 states. [2020-02-10 20:14:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:07,683 INFO L93 Difference]: Finished difference Result 286 states and 682 transitions. [2020-02-10 20:14:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:07,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:07,684 INFO L225 Difference]: With dead ends: 286 [2020-02-10 20:14:07,684 INFO L226 Difference]: Without dead ends: 270 [2020-02-10 20:14:07,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-02-10 20:14:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 162. [2020-02-10 20:14:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-02-10 20:14:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 451 transitions. [2020-02-10 20:14:07,688 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 451 transitions. Word has length 19 [2020-02-10 20:14:07,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:07,688 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 451 transitions. [2020-02-10 20:14:07,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 451 transitions. [2020-02-10 20:14:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:07,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:07,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:07,689 INFO L427 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:07,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:07,689 INFO L82 PathProgramCache]: Analyzing trace with hash -930221548, now seen corresponding path program 418 times [2020-02-10 20:14:07,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:07,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863898769] [2020-02-10 20:14:07,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:07,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863898769] [2020-02-10 20:14:07,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:07,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:07,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192656514] [2020-02-10 20:14:07,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:07,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:07,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:07,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:07,886 INFO L87 Difference]: Start difference. First operand 162 states and 451 transitions. Second operand 8 states. [2020-02-10 20:14:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:07,972 INFO L93 Difference]: Finished difference Result 273 states and 661 transitions. [2020-02-10 20:14:07,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:07,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:07,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:07,973 INFO L225 Difference]: With dead ends: 273 [2020-02-10 20:14:07,973 INFO L226 Difference]: Without dead ends: 256 [2020-02-10 20:14:07,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-02-10 20:14:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 157. [2020-02-10 20:14:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 20:14:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 437 transitions. [2020-02-10 20:14:07,978 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 437 transitions. Word has length 19 [2020-02-10 20:14:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:07,978 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 437 transitions. [2020-02-10 20:14:07,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 437 transitions. [2020-02-10 20:14:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:07,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:07,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:07,978 INFO L427 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:07,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:07,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2094625272, now seen corresponding path program 419 times [2020-02-10 20:14:07,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:07,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861278737] [2020-02-10 20:14:07,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:08,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861278737] [2020-02-10 20:14:08,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:08,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:08,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755913090] [2020-02-10 20:14:08,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:08,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:08,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:08,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:08,164 INFO L87 Difference]: Start difference. First operand 157 states and 437 transitions. Second operand 8 states. [2020-02-10 20:14:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:08,236 INFO L93 Difference]: Finished difference Result 283 states and 672 transitions. [2020-02-10 20:14:08,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:08,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:08,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:08,237 INFO L225 Difference]: With dead ends: 283 [2020-02-10 20:14:08,237 INFO L226 Difference]: Without dead ends: 269 [2020-02-10 20:14:08,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:08,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-02-10 20:14:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 161. [2020-02-10 20:14:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-02-10 20:14:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 445 transitions. [2020-02-10 20:14:08,242 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 445 transitions. Word has length 19 [2020-02-10 20:14:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:08,242 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 445 transitions. [2020-02-10 20:14:08,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 445 transitions. [2020-02-10 20:14:08,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:08,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:08,242 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:08,242 INFO L427 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:08,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:08,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2094030626, now seen corresponding path program 420 times [2020-02-10 20:14:08,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:08,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517581335] [2020-02-10 20:14:08,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:08,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517581335] [2020-02-10 20:14:08,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:08,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:08,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954272469] [2020-02-10 20:14:08,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:08,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:08,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:08,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:08,429 INFO L87 Difference]: Start difference. First operand 161 states and 445 transitions. Second operand 8 states. [2020-02-10 20:14:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:08,505 INFO L93 Difference]: Finished difference Result 272 states and 655 transitions. [2020-02-10 20:14:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:08,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:08,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:08,507 INFO L225 Difference]: With dead ends: 272 [2020-02-10 20:14:08,507 INFO L226 Difference]: Without dead ends: 250 [2020-02-10 20:14:08,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:08,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-02-10 20:14:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 151. [2020-02-10 20:14:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:14:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 423 transitions. [2020-02-10 20:14:08,511 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 423 transitions. Word has length 19 [2020-02-10 20:14:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:08,511 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 423 transitions. [2020-02-10 20:14:08,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 423 transitions. [2020-02-10 20:14:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:08,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:08,512 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:08,512 INFO L427 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:08,512 INFO L82 PathProgramCache]: Analyzing trace with hash 677525702, now seen corresponding path program 421 times [2020-02-10 20:14:08,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:08,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206018326] [2020-02-10 20:14:08,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:08,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206018326] [2020-02-10 20:14:08,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:08,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:08,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225682266] [2020-02-10 20:14:08,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:08,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:08,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:08,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:08,699 INFO L87 Difference]: Start difference. First operand 151 states and 423 transitions. Second operand 8 states. [2020-02-10 20:14:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:08,758 INFO L93 Difference]: Finished difference Result 273 states and 645 transitions. [2020-02-10 20:14:08,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:08,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:08,759 INFO L225 Difference]: With dead ends: 273 [2020-02-10 20:14:08,759 INFO L226 Difference]: Without dead ends: 257 [2020-02-10 20:14:08,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-02-10 20:14:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 157. [2020-02-10 20:14:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 20:14:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 437 transitions. [2020-02-10 20:14:08,764 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 437 transitions. Word has length 19 [2020-02-10 20:14:08,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:08,764 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 437 transitions. [2020-02-10 20:14:08,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:08,764 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 437 transitions. [2020-02-10 20:14:08,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:08,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:08,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:08,765 INFO L427 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:08,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash 936583928, now seen corresponding path program 422 times [2020-02-10 20:14:08,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:08,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715103903] [2020-02-10 20:14:08,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:08,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715103903] [2020-02-10 20:14:08,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:08,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:08,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495835548] [2020-02-10 20:14:08,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:08,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:08,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:08,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:08,961 INFO L87 Difference]: Start difference. First operand 157 states and 437 transitions. Second operand 8 states. [2020-02-10 20:14:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:09,026 INFO L93 Difference]: Finished difference Result 267 states and 630 transitions. [2020-02-10 20:14:09,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:09,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:09,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:09,027 INFO L225 Difference]: With dead ends: 267 [2020-02-10 20:14:09,027 INFO L226 Difference]: Without dead ends: 254 [2020-02-10 20:14:09,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-02-10 20:14:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 154. [2020-02-10 20:14:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:14:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 430 transitions. [2020-02-10 20:14:09,031 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 430 transitions. Word has length 19 [2020-02-10 20:14:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:09,031 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 430 transitions. [2020-02-10 20:14:09,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 430 transitions. [2020-02-10 20:14:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:09,031 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:09,031 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:09,032 INFO L427 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash -922912152, now seen corresponding path program 423 times [2020-02-10 20:14:09,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:09,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972487220] [2020-02-10 20:14:09,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:09,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972487220] [2020-02-10 20:14:09,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:09,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:09,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723275688] [2020-02-10 20:14:09,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:09,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:09,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:09,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:09,235 INFO L87 Difference]: Start difference. First operand 154 states and 430 transitions. Second operand 8 states. [2020-02-10 20:14:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:09,297 INFO L93 Difference]: Finished difference Result 264 states and 625 transitions. [2020-02-10 20:14:09,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:09,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:09,298 INFO L225 Difference]: With dead ends: 264 [2020-02-10 20:14:09,298 INFO L226 Difference]: Without dead ends: 248 [2020-02-10 20:14:09,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-02-10 20:14:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 159. [2020-02-10 20:14:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-02-10 20:14:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 439 transitions. [2020-02-10 20:14:09,302 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 439 transitions. Word has length 19 [2020-02-10 20:14:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:09,302 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 439 transitions. [2020-02-10 20:14:09,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 439 transitions. [2020-02-10 20:14:09,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:09,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:09,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:09,302 INFO L427 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:09,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1673974246, now seen corresponding path program 424 times [2020-02-10 20:14:09,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:09,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986536427] [2020-02-10 20:14:09,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:09,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986536427] [2020-02-10 20:14:09,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:09,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:09,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168096245] [2020-02-10 20:14:09,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:09,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:09,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:09,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:09,494 INFO L87 Difference]: Start difference. First operand 159 states and 439 transitions. Second operand 8 states. [2020-02-10 20:14:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:09,573 INFO L93 Difference]: Finished difference Result 251 states and 604 transitions. [2020-02-10 20:14:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:09,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:09,574 INFO L225 Difference]: With dead ends: 251 [2020-02-10 20:14:09,574 INFO L226 Difference]: Without dead ends: 234 [2020-02-10 20:14:09,575 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-02-10 20:14:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 154. [2020-02-10 20:14:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:14:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 427 transitions. [2020-02-10 20:14:09,578 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 427 transitions. Word has length 19 [2020-02-10 20:14:09,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:09,578 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 427 transitions. [2020-02-10 20:14:09,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 427 transitions. [2020-02-10 20:14:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:09,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:09,579 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:09,579 INFO L427 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash -522490524, now seen corresponding path program 425 times [2020-02-10 20:14:09,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:09,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453715186] [2020-02-10 20:14:09,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:09,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453715186] [2020-02-10 20:14:09,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:09,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:09,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453369772] [2020-02-10 20:14:09,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:09,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:09,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:09,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:09,779 INFO L87 Difference]: Start difference. First operand 154 states and 427 transitions. Second operand 8 states. [2020-02-10 20:14:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:09,843 INFO L93 Difference]: Finished difference Result 246 states and 592 transitions. [2020-02-10 20:14:09,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:09,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:09,844 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:14:09,844 INFO L226 Difference]: Without dead ends: 236 [2020-02-10 20:14:09,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-02-10 20:14:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 156. [2020-02-10 20:14:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-02-10 20:14:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 430 transitions. [2020-02-10 20:14:09,848 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 430 transitions. Word has length 19 [2020-02-10 20:14:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:09,848 INFO L479 AbstractCegarLoop]: Abstraction has 156 states and 430 transitions. [2020-02-10 20:14:09,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 430 transitions. [2020-02-10 20:14:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:09,848 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:09,848 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:09,849 INFO L427 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:09,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:09,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1377797178, now seen corresponding path program 426 times [2020-02-10 20:14:09,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:09,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197403088] [2020-02-10 20:14:09,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:10,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197403088] [2020-02-10 20:14:10,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:10,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:10,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082156299] [2020-02-10 20:14:10,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:10,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:10,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:10,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:10,042 INFO L87 Difference]: Start difference. First operand 156 states and 430 transitions. Second operand 8 states. [2020-02-10 20:14:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:10,125 INFO L93 Difference]: Finished difference Result 235 states and 578 transitions. [2020-02-10 20:14:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:10,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:10,126 INFO L225 Difference]: With dead ends: 235 [2020-02-10 20:14:10,126 INFO L226 Difference]: Without dead ends: 218 [2020-02-10 20:14:10,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-02-10 20:14:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 151. [2020-02-10 20:14:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:14:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 420 transitions. [2020-02-10 20:14:10,129 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 420 transitions. Word has length 19 [2020-02-10 20:14:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:10,129 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 420 transitions. [2020-02-10 20:14:10,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 420 transitions. [2020-02-10 20:14:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:10,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:10,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:10,130 INFO L427 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:10,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:10,130 INFO L82 PathProgramCache]: Analyzing trace with hash -722039428, now seen corresponding path program 427 times [2020-02-10 20:14:10,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:10,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878670583] [2020-02-10 20:14:10,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:10,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878670583] [2020-02-10 20:14:10,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:10,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:10,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819878893] [2020-02-10 20:14:10,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:10,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:10,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:10,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:10,302 INFO L87 Difference]: Start difference. First operand 151 states and 420 transitions. Second operand 8 states. [2020-02-10 20:14:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:10,376 INFO L93 Difference]: Finished difference Result 266 states and 629 transitions. [2020-02-10 20:14:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:10,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:10,377 INFO L225 Difference]: With dead ends: 266 [2020-02-10 20:14:10,377 INFO L226 Difference]: Without dead ends: 252 [2020-02-10 20:14:10,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-02-10 20:14:10,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 155. [2020-02-10 20:14:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-02-10 20:14:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 430 transitions. [2020-02-10 20:14:10,381 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 430 transitions. Word has length 19 [2020-02-10 20:14:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:10,381 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 430 transitions. [2020-02-10 20:14:10,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 430 transitions. [2020-02-10 20:14:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:10,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:10,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:10,382 INFO L427 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:10,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:10,382 INFO L82 PathProgramCache]: Analyzing trace with hash 398090402, now seen corresponding path program 428 times [2020-02-10 20:14:10,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:10,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081659580] [2020-02-10 20:14:10,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:10,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081659580] [2020-02-10 20:14:10,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:10,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:10,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459830982] [2020-02-10 20:14:10,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:10,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:10,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:10,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:10,562 INFO L87 Difference]: Start difference. First operand 155 states and 430 transitions. Second operand 8 states. [2020-02-10 20:14:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:10,624 INFO L93 Difference]: Finished difference Result 262 states and 618 transitions. [2020-02-10 20:14:10,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:10,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:10,625 INFO L225 Difference]: With dead ends: 262 [2020-02-10 20:14:10,625 INFO L226 Difference]: Without dead ends: 250 [2020-02-10 20:14:10,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-02-10 20:14:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 153. [2020-02-10 20:14:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-02-10 20:14:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 425 transitions. [2020-02-10 20:14:10,630 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 425 transitions. Word has length 19 [2020-02-10 20:14:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:10,630 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 425 transitions. [2020-02-10 20:14:10,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 425 transitions. [2020-02-10 20:14:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:10,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:10,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:10,631 INFO L427 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:10,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:10,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1466741926, now seen corresponding path program 429 times [2020-02-10 20:14:10,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:10,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735745406] [2020-02-10 20:14:10,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:10,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735745406] [2020-02-10 20:14:10,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:10,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:10,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985497253] [2020-02-10 20:14:10,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:10,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:10,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:10,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:10,817 INFO L87 Difference]: Start difference. First operand 153 states and 425 transitions. Second operand 8 states. [2020-02-10 20:14:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:10,894 INFO L93 Difference]: Finished difference Result 260 states and 615 transitions. [2020-02-10 20:14:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:10,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:10,895 INFO L225 Difference]: With dead ends: 260 [2020-02-10 20:14:10,895 INFO L226 Difference]: Without dead ends: 246 [2020-02-10 20:14:10,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-02-10 20:14:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 157. [2020-02-10 20:14:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 20:14:10,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 433 transitions. [2020-02-10 20:14:10,899 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 433 transitions. Word has length 19 [2020-02-10 20:14:10,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:10,900 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 433 transitions. [2020-02-10 20:14:10,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 433 transitions. [2020-02-10 20:14:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:10,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:10,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:10,900 INFO L427 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash 2082928226, now seen corresponding path program 430 times [2020-02-10 20:14:10,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:10,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136829655] [2020-02-10 20:14:10,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:11,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136829655] [2020-02-10 20:14:11,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:11,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:11,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187162271] [2020-02-10 20:14:11,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:11,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:11,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:11,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:11,075 INFO L87 Difference]: Start difference. First operand 157 states and 433 transitions. Second operand 8 states. [2020-02-10 20:14:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:11,153 INFO L93 Difference]: Finished difference Result 249 states and 598 transitions. [2020-02-10 20:14:11,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:11,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:11,154 INFO L225 Difference]: With dead ends: 249 [2020-02-10 20:14:11,154 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 20:14:11,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 20:14:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 153. [2020-02-10 20:14:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-02-10 20:14:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 423 transitions. [2020-02-10 20:14:11,158 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 423 transitions. Word has length 19 [2020-02-10 20:14:11,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:11,159 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 423 transitions. [2020-02-10 20:14:11,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 423 transitions. [2020-02-10 20:14:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:11,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:11,159 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:11,159 INFO L427 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:11,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:11,160 INFO L82 PathProgramCache]: Analyzing trace with hash -137139400, now seen corresponding path program 431 times [2020-02-10 20:14:11,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:11,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446181766] [2020-02-10 20:14:11,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:11,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446181766] [2020-02-10 20:14:11,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:11,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:11,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893194660] [2020-02-10 20:14:11,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:11,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:11,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:11,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:11,340 INFO L87 Difference]: Start difference. First operand 153 states and 423 transitions. Second operand 8 states. [2020-02-10 20:14:11,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:11,405 INFO L93 Difference]: Finished difference Result 245 states and 588 transitions. [2020-02-10 20:14:11,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:11,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:11,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:11,406 INFO L225 Difference]: With dead ends: 245 [2020-02-10 20:14:11,406 INFO L226 Difference]: Without dead ends: 235 [2020-02-10 20:14:11,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:11,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-02-10 20:14:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 155. [2020-02-10 20:14:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-02-10 20:14:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 426 transitions. [2020-02-10 20:14:11,410 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 426 transitions. Word has length 19 [2020-02-10 20:14:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:11,410 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 426 transitions. [2020-02-10 20:14:11,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 426 transitions. [2020-02-10 20:14:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:11,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:11,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:11,411 INFO L427 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:11,411 INFO L82 PathProgramCache]: Analyzing trace with hash -992446054, now seen corresponding path program 432 times [2020-02-10 20:14:11,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:11,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603991081] [2020-02-10 20:14:11,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:11,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603991081] [2020-02-10 20:14:11,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:11,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:11,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911379974] [2020-02-10 20:14:11,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:11,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:11,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:11,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:11,591 INFO L87 Difference]: Start difference. First operand 155 states and 426 transitions. Second operand 8 states. [2020-02-10 20:14:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:11,666 INFO L93 Difference]: Finished difference Result 234 states and 574 transitions. [2020-02-10 20:14:11,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:11,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:11,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:11,667 INFO L225 Difference]: With dead ends: 234 [2020-02-10 20:14:11,667 INFO L226 Difference]: Without dead ends: 214 [2020-02-10 20:14:11,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-02-10 20:14:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 147. [2020-02-10 20:14:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:14:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 412 transitions. [2020-02-10 20:14:11,671 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 412 transitions. Word has length 19 [2020-02-10 20:14:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:11,671 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 412 transitions. [2020-02-10 20:14:11,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:11,672 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 412 transitions. [2020-02-10 20:14:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:11,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:11,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:11,672 INFO L427 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:11,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:11,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1774006882, now seen corresponding path program 433 times [2020-02-10 20:14:11,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:11,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313743466] [2020-02-10 20:14:11,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:11,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313743466] [2020-02-10 20:14:11,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:11,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:11,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730973032] [2020-02-10 20:14:11,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:11,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:11,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:11,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:11,870 INFO L87 Difference]: Start difference. First operand 147 states and 412 transitions. Second operand 8 states. [2020-02-10 20:14:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:11,929 INFO L93 Difference]: Finished difference Result 260 states and 610 transitions. [2020-02-10 20:14:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:11,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:11,930 INFO L225 Difference]: With dead ends: 260 [2020-02-10 20:14:11,930 INFO L226 Difference]: Without dead ends: 244 [2020-02-10 20:14:11,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-02-10 20:14:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 154. [2020-02-10 20:14:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:14:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 430 transitions. [2020-02-10 20:14:11,934 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 430 transitions. Word has length 19 [2020-02-10 20:14:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:11,934 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 430 transitions. [2020-02-10 20:14:11,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 430 transitions. [2020-02-10 20:14:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:11,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:11,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:11,935 INFO L427 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash -377719664, now seen corresponding path program 434 times [2020-02-10 20:14:11,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:11,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340086507] [2020-02-10 20:14:11,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:12,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340086507] [2020-02-10 20:14:12,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:12,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:12,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596246192] [2020-02-10 20:14:12,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:12,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:12,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:12,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:12,133 INFO L87 Difference]: Start difference. First operand 154 states and 430 transitions. Second operand 8 states. [2020-02-10 20:14:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:12,210 INFO L93 Difference]: Finished difference Result 254 states and 595 transitions. [2020-02-10 20:14:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:12,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:12,211 INFO L225 Difference]: With dead ends: 254 [2020-02-10 20:14:12,211 INFO L226 Difference]: Without dead ends: 241 [2020-02-10 20:14:12,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-02-10 20:14:12,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 151. [2020-02-10 20:14:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:14:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 424 transitions. [2020-02-10 20:14:12,216 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 424 transitions. Word has length 19 [2020-02-10 20:14:12,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:12,216 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 424 transitions. [2020-02-10 20:14:12,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:12,217 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 424 transitions. [2020-02-10 20:14:12,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:12,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:12,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:12,217 INFO L427 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:12,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:12,217 INFO L82 PathProgramCache]: Analyzing trace with hash 173569028, now seen corresponding path program 435 times [2020-02-10 20:14:12,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:12,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415894590] [2020-02-10 20:14:12,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:12,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415894590] [2020-02-10 20:14:12,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:12,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:12,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026525953] [2020-02-10 20:14:12,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:12,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:12,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:12,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:12,432 INFO L87 Difference]: Start difference. First operand 151 states and 424 transitions. Second operand 8 states. [2020-02-10 20:14:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:12,485 INFO L93 Difference]: Finished difference Result 260 states and 608 transitions. [2020-02-10 20:14:12,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:12,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:12,486 INFO L225 Difference]: With dead ends: 260 [2020-02-10 20:14:12,486 INFO L226 Difference]: Without dead ends: 244 [2020-02-10 20:14:12,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:12,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-02-10 20:14:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 154. [2020-02-10 20:14:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:14:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 428 transitions. [2020-02-10 20:14:12,490 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 428 transitions. Word has length 19 [2020-02-10 20:14:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:12,490 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 428 transitions. [2020-02-10 20:14:12,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 428 transitions. [2020-02-10 20:14:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:12,491 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:12,491 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:12,491 INFO L427 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:12,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:12,491 INFO L82 PathProgramCache]: Analyzing trace with hash 432627254, now seen corresponding path program 436 times [2020-02-10 20:14:12,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:12,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470239264] [2020-02-10 20:14:12,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:12,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:14:12,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470239264] [2020-02-10 20:14:12,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:12,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:12,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312435990] [2020-02-10 20:14:12,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:12,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:12,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:12,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:12,692 INFO L87 Difference]: Start difference. First operand 154 states and 428 transitions. Second operand 8 states. [2020-02-10 20:14:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:12,749 INFO L93 Difference]: Finished difference Result 254 states and 593 transitions. [2020-02-10 20:14:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:12,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:12,750 INFO L225 Difference]: With dead ends: 254 [2020-02-10 20:14:12,750 INFO L226 Difference]: Without dead ends: 241 [2020-02-10 20:14:12,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-02-10 20:14:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 151. [2020-02-10 20:14:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:14:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 422 transitions. [2020-02-10 20:14:12,755 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 422 transitions. Word has length 19 [2020-02-10 20:14:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:12,755 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 422 transitions. [2020-02-10 20:14:12,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 422 transitions. [2020-02-10 20:14:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:12,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:12,755 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:12,756 INFO L427 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash -807811068, now seen corresponding path program 437 times [2020-02-10 20:14:12,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:12,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79032824] [2020-02-10 20:14:12,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:12,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79032824] [2020-02-10 20:14:12,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:12,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:12,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891786078] [2020-02-10 20:14:12,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:12,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:12,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:12,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:12,961 INFO L87 Difference]: Start difference. First operand 151 states and 422 transitions. Second operand 8 states. [2020-02-10 20:14:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:13,038 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-02-10 20:14:13,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:13,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:13,039 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:14:13,039 INFO L226 Difference]: Without dead ends: 236 [2020-02-10 20:14:13,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-02-10 20:14:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 152. [2020-02-10 20:14:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:14:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-02-10 20:14:13,042 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-02-10 20:14:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:13,042 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-02-10 20:14:13,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-02-10 20:14:13,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:13,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:13,043 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:13,043 INFO L427 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:13,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:13,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1047453406, now seen corresponding path program 438 times [2020-02-10 20:14:13,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:13,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454236260] [2020-02-10 20:14:13,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:13,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454236260] [2020-02-10 20:14:13,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:13,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:13,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026078503] [2020-02-10 20:14:13,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:13,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:13,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:13,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:13,254 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-02-10 20:14:13,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:13,316 INFO L93 Difference]: Finished difference Result 246 states and 576 transitions. [2020-02-10 20:14:13,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:13,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:13,317 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:14:13,317 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 20:14:13,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:13,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 20:14:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 149. [2020-02-10 20:14:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:14:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 418 transitions. [2020-02-10 20:14:13,321 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 418 transitions. Word has length 19 [2020-02-10 20:14:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:13,321 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 418 transitions. [2020-02-10 20:14:13,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 418 transitions. [2020-02-10 20:14:13,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:13,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:13,321 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:13,321 INFO L427 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:13,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:13,322 INFO L82 PathProgramCache]: Analyzing trace with hash -594926336, now seen corresponding path program 439 times [2020-02-10 20:14:13,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:13,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877584608] [2020-02-10 20:14:13,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:13,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877584608] [2020-02-10 20:14:13,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:13,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:13,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904601353] [2020-02-10 20:14:13,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:13,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:13,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:13,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:13,525 INFO L87 Difference]: Start difference. First operand 149 states and 418 transitions. Second operand 8 states. [2020-02-10 20:14:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:13,603 INFO L93 Difference]: Finished difference Result 258 states and 603 transitions. [2020-02-10 20:14:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:13,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:13,604 INFO L225 Difference]: With dead ends: 258 [2020-02-10 20:14:13,604 INFO L226 Difference]: Without dead ends: 242 [2020-02-10 20:14:13,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-02-10 20:14:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 155. [2020-02-10 20:14:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-02-10 20:14:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 432 transitions. [2020-02-10 20:14:13,608 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 432 transitions. Word has length 19 [2020-02-10 20:14:13,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:13,608 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 432 transitions. [2020-02-10 20:14:13,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:13,608 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 432 transitions. [2020-02-10 20:14:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:13,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:13,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:13,609 INFO L427 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:13,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:13,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1548314414, now seen corresponding path program 440 times [2020-02-10 20:14:13,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:13,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048968067] [2020-02-10 20:14:13,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14: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:14:13,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048968067] [2020-02-10 20:14:13,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:13,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:13,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997111514] [2020-02-10 20:14:13,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:13,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:13,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:13,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:13,809 INFO L87 Difference]: Start difference. First operand 155 states and 432 transitions. Second operand 8 states. [2020-02-10 20:14:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:13,887 INFO L93 Difference]: Finished difference Result 252 states and 588 transitions. [2020-02-10 20:14:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:13,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:13,888 INFO L225 Difference]: With dead ends: 252 [2020-02-10 20:14:13,888 INFO L226 Difference]: Without dead ends: 239 [2020-02-10 20:14:13,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-02-10 20:14:13,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 152. [2020-02-10 20:14:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:14:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 425 transitions. [2020-02-10 20:14:13,894 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 425 transitions. Word has length 19 [2020-02-10 20:14:13,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:13,894 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 425 transitions. [2020-02-10 20:14:13,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 425 transitions. [2020-02-10 20:14:13,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:13,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:13,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:13,895 INFO L427 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:13,895 INFO L82 PathProgramCache]: Analyzing trace with hash 499165252, now seen corresponding path program 441 times [2020-02-10 20:14:13,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:13,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814712577] [2020-02-10 20:14:13,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:14,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814712577] [2020-02-10 20:14:14,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:14,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:14,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074699022] [2020-02-10 20:14:14,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:14,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:14,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:14,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:14,104 INFO L87 Difference]: Start difference. First operand 152 states and 425 transitions. Second operand 8 states. [2020-02-10 20:14:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:14,165 INFO L93 Difference]: Finished difference Result 254 states and 597 transitions. [2020-02-10 20:14:14,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:14,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:14,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:14,166 INFO L225 Difference]: With dead ends: 254 [2020-02-10 20:14:14,167 INFO L226 Difference]: Without dead ends: 238 [2020-02-10 20:14:14,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-02-10 20:14:14,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 157. [2020-02-10 20:14:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 20:14:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 434 transitions. [2020-02-10 20:14:14,171 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 434 transitions. Word has length 19 [2020-02-10 20:14:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:14,171 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 434 transitions. [2020-02-10 20:14:14,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 434 transitions. [2020-02-10 20:14:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:14,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:14,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:14,172 INFO L427 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:14,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:14,172 INFO L82 PathProgramCache]: Analyzing trace with hash -251896842, now seen corresponding path program 442 times [2020-02-10 20:14:14,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:14,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749218519] [2020-02-10 20:14:14,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:14,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749218519] [2020-02-10 20:14:14,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:14,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:14,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355457704] [2020-02-10 20:14:14,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:14,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:14,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:14,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:14,371 INFO L87 Difference]: Start difference. First operand 157 states and 434 transitions. Second operand 8 states. [2020-02-10 20:14:14,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:14,451 INFO L93 Difference]: Finished difference Result 241 states and 576 transitions. [2020-02-10 20:14:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:14,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:14,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:14,452 INFO L225 Difference]: With dead ends: 241 [2020-02-10 20:14:14,452 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 20:14:14,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 20:14:14,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2020-02-10 20:14:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:14:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 422 transitions. [2020-02-10 20:14:14,456 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 422 transitions. Word has length 19 [2020-02-10 20:14:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:14,456 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 422 transitions. [2020-02-10 20:14:14,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 422 transitions. [2020-02-10 20:14:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:14,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:14,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:14,456 INFO L427 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:14,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:14,457 INFO L82 PathProgramCache]: Analyzing trace with hash 908750314, now seen corresponding path program 443 times [2020-02-10 20:14:14,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:14,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245772931] [2020-02-10 20:14:14,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:14,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245772931] [2020-02-10 20:14:14,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:14,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:14,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85438536] [2020-02-10 20:14:14,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:14,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:14,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:14,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:14,657 INFO L87 Difference]: Start difference. First operand 152 states and 422 transitions. Second operand 8 states. [2020-02-10 20:14:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:14,739 INFO L93 Difference]: Finished difference Result 245 states and 573 transitions. [2020-02-10 20:14:14,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:14,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:14,740 INFO L225 Difference]: With dead ends: 245 [2020-02-10 20:14:14,740 INFO L226 Difference]: Without dead ends: 235 [2020-02-10 20:14:14,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-02-10 20:14:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 154. [2020-02-10 20:14:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:14:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 425 transitions. [2020-02-10 20:14:14,744 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 425 transitions. Word has length 19 [2020-02-10 20:14:14,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:14,745 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 425 transitions. [2020-02-10 20:14:14,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 425 transitions. [2020-02-10 20:14:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:14,745 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:14,745 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:14,745 INFO L427 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:14,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:14,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1675603674, now seen corresponding path program 444 times [2020-02-10 20:14:14,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:14,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808075820] [2020-02-10 20:14:14,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:14,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808075820] [2020-02-10 20:14:14,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:14,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:14,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521101751] [2020-02-10 20:14:14,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:14,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:14,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:14,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:14,950 INFO L87 Difference]: Start difference. First operand 154 states and 425 transitions. Second operand 8 states. [2020-02-10 20:14:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:15,027 INFO L93 Difference]: Finished difference Result 238 states and 567 transitions. [2020-02-10 20:14:15,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:15,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:15,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:15,028 INFO L225 Difference]: With dead ends: 238 [2020-02-10 20:14:15,028 INFO L226 Difference]: Without dead ends: 221 [2020-02-10 20:14:15,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:15,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-02-10 20:14:15,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 149. [2020-02-10 20:14:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:14:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 416 transitions. [2020-02-10 20:14:15,032 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 416 transitions. Word has length 19 [2020-02-10 20:14:15,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:15,032 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 416 transitions. [2020-02-10 20:14:15,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 416 transitions. [2020-02-10 20:14:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:15,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:15,032 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:15,032 INFO L427 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:15,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:15,033 INFO L82 PathProgramCache]: Analyzing trace with hash -269330112, now seen corresponding path program 445 times [2020-02-10 20:14:15,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:15,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500634810] [2020-02-10 20:14:15,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:15,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500634810] [2020-02-10 20:14:15,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:15,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:15,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562265035] [2020-02-10 20:14:15,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:15,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:15,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:15,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:15,239 INFO L87 Difference]: Start difference. First operand 149 states and 416 transitions. Second operand 8 states. [2020-02-10 20:14:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:15,298 INFO L93 Difference]: Finished difference Result 244 states and 569 transitions. [2020-02-10 20:14:15,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:15,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:15,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:15,299 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:14:15,299 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:14:15,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:14:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 155. [2020-02-10 20:14:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-02-10 20:14:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 430 transitions. [2020-02-10 20:14:15,304 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 430 transitions. Word has length 19 [2020-02-10 20:14:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:15,304 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 430 transitions. [2020-02-10 20:14:15,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 430 transitions. [2020-02-10 20:14:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:15,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:15,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:15,304 INFO L427 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:15,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:15,305 INFO L82 PathProgramCache]: Analyzing trace with hash -10271886, now seen corresponding path program 446 times [2020-02-10 20:14:15,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:15,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993873656] [2020-02-10 20:14:15,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:15,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993873656] [2020-02-10 20:14:15,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:15,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:15,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588684283] [2020-02-10 20:14:15,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:15,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:15,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:15,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:15,508 INFO L87 Difference]: Start difference. First operand 155 states and 430 transitions. Second operand 8 states. [2020-02-10 20:14:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:15,564 INFO L93 Difference]: Finished difference Result 238 states and 554 transitions. [2020-02-10 20:14:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:15,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:15,565 INFO L225 Difference]: With dead ends: 238 [2020-02-10 20:14:15,565 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:14:15,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:14:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 152. [2020-02-10 20:14:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:14:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-02-10 20:14:15,569 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-02-10 20:14:15,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:15,569 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-02-10 20:14:15,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-02-10 20:14:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:15,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:15,570 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:15,570 INFO L427 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:15,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:15,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1869767966, now seen corresponding path program 447 times [2020-02-10 20:14:15,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:15,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918298875] [2020-02-10 20:14:15,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:15,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918298875] [2020-02-10 20:14:15,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:15,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:15,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032063644] [2020-02-10 20:14:15,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:15,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:15,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:15,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:15,783 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-02-10 20:14:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:15,841 INFO L93 Difference]: Finished difference Result 235 states and 549 transitions. [2020-02-10 20:14:15,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:15,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:15,842 INFO L225 Difference]: With dead ends: 235 [2020-02-10 20:14:15,842 INFO L226 Difference]: Without dead ends: 219 [2020-02-10 20:14:15,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:15,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-02-10 20:14:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 157. [2020-02-10 20:14:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 20:14:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 432 transitions. [2020-02-10 20:14:15,846 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 432 transitions. Word has length 19 [2020-02-10 20:14:15,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:15,846 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 432 transitions. [2020-02-10 20:14:15,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 432 transitions. [2020-02-10 20:14:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:15,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:15,847 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:15,847 INFO L427 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:15,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:15,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1674137236, now seen corresponding path program 448 times [2020-02-10 20:14:15,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:15,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025442153] [2020-02-10 20:14:15,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:16,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025442153] [2020-02-10 20:14:16,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:16,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:16,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557248830] [2020-02-10 20:14:16,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:16,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:16,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:16,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:16,068 INFO L87 Difference]: Start difference. First operand 157 states and 432 transitions. Second operand 8 states. [2020-02-10 20:14:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:16,151 INFO L93 Difference]: Finished difference Result 222 states and 528 transitions. [2020-02-10 20:14:16,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:16,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:16,153 INFO L225 Difference]: With dead ends: 222 [2020-02-10 20:14:16,153 INFO L226 Difference]: Without dead ends: 205 [2020-02-10 20:14:16,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-02-10 20:14:16,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 152. [2020-02-10 20:14:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:14:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 420 transitions. [2020-02-10 20:14:16,156 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 420 transitions. Word has length 19 [2020-02-10 20:14:16,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:16,156 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 420 transitions. [2020-02-10 20:14:16,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 420 transitions. [2020-02-10 20:14:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:16,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:16,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:16,157 INFO L427 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:16,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:16,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1469346338, now seen corresponding path program 449 times [2020-02-10 20:14:16,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:16,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749138284] [2020-02-10 20:14:16,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:16,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749138284] [2020-02-10 20:14:16,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:16,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:16,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164597744] [2020-02-10 20:14:16,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:16,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:16,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:16,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:16,363 INFO L87 Difference]: Start difference. First operand 152 states and 420 transitions. Second operand 8 states. [2020-02-10 20:14:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:16,419 INFO L93 Difference]: Finished difference Result 217 states and 516 transitions. [2020-02-10 20:14:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:16,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:16,420 INFO L225 Difference]: With dead ends: 217 [2020-02-10 20:14:16,420 INFO L226 Difference]: Without dead ends: 207 [2020-02-10 20:14:16,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:16,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-02-10 20:14:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 154. [2020-02-10 20:14:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:14:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 423 transitions. [2020-02-10 20:14:16,423 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 423 transitions. Word has length 19 [2020-02-10 20:14:16,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:16,423 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 423 transitions. [2020-02-10 20:14:16,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 423 transitions. [2020-02-10 20:14:16,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:16,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:16,424 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:16,424 INFO L427 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:16,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:16,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1970314304, now seen corresponding path program 450 times [2020-02-10 20:14:16,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:16,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095280737] [2020-02-10 20:14:16,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:16,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095280737] [2020-02-10 20:14:16,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:16,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:16,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083813285] [2020-02-10 20:14:16,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:16,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:16,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:16,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:16,625 INFO L87 Difference]: Start difference. First operand 154 states and 423 transitions. Second operand 8 states. [2020-02-10 20:14:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:16,700 INFO L93 Difference]: Finished difference Result 206 states and 502 transitions. [2020-02-10 20:14:16,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:16,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:16,702 INFO L225 Difference]: With dead ends: 206 [2020-02-10 20:14:16,702 INFO L226 Difference]: Without dead ends: 189 [2020-02-10 20:14:16,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-02-10 20:14:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 149. [2020-02-10 20:14:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:14:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 414 transitions. [2020-02-10 20:14:16,706 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 414 transitions. Word has length 19 [2020-02-10 20:14:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:16,706 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 414 transitions. [2020-02-10 20:14:16,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 414 transitions. [2020-02-10 20:14:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:16,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:16,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:16,706 INFO L427 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:16,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:16,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1205521176, now seen corresponding path program 451 times [2020-02-10 20:14:16,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:16,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750092199] [2020-02-10 20:14:16,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:16,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750092199] [2020-02-10 20:14:16,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:16,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:16,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011164872] [2020-02-10 20:14:16,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:16,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:16,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:16,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:16,929 INFO L87 Difference]: Start difference. First operand 149 states and 414 transitions. Second operand 8 states. [2020-02-10 20:14:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:17,014 INFO L93 Difference]: Finished difference Result 214 states and 510 transitions. [2020-02-10 20:14:17,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:17,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:17,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:17,015 INFO L225 Difference]: With dead ends: 214 [2020-02-10 20:14:17,015 INFO L226 Difference]: Without dead ends: 204 [2020-02-10 20:14:17,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-02-10 20:14:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 151. [2020-02-10 20:14:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:14:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 418 transitions. [2020-02-10 20:14:17,019 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 418 transitions. Word has length 19 [2020-02-10 20:14:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:17,019 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 418 transitions. [2020-02-10 20:14:17,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 418 transitions. [2020-02-10 20:14:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:17,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:17,020 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:17,020 INFO L427 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:17,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:17,020 INFO L82 PathProgramCache]: Analyzing trace with hash 965878838, now seen corresponding path program 452 times [2020-02-10 20:14:17,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:17,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916366322] [2020-02-10 20:14:17,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:17,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916366322] [2020-02-10 20:14:17,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:17,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:17,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228052743] [2020-02-10 20:14:17,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:17,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:17,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:17,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:17,239 INFO L87 Difference]: Start difference. First operand 151 states and 418 transitions. Second operand 8 states. [2020-02-10 20:14:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:17,300 INFO L93 Difference]: Finished difference Result 214 states and 509 transitions. [2020-02-10 20:14:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:17,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:17,301 INFO L225 Difference]: With dead ends: 214 [2020-02-10 20:14:17,301 INFO L226 Difference]: Without dead ends: 203 [2020-02-10 20:14:17,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-02-10 20:14:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-02-10 20:14:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:14:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-02-10 20:14:17,305 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-02-10 20:14:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:17,306 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-02-10 20:14:17,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-02-10 20:14:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:17,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:17,306 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:17,306 INFO L427 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:17,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:17,306 INFO L82 PathProgramCache]: Analyzing trace with hash 460818678, now seen corresponding path program 453 times [2020-02-10 20:14:17,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:17,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126629214] [2020-02-10 20:14:17,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:17,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126629214] [2020-02-10 20:14:17,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:17,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:17,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613657895] [2020-02-10 20:14:17,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:17,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:17,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:17,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:17,513 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-02-10 20:14:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:17,588 INFO L93 Difference]: Finished difference Result 211 states and 504 transitions. [2020-02-10 20:14:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:17,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:17,588 INFO L225 Difference]: With dead ends: 211 [2020-02-10 20:14:17,588 INFO L226 Difference]: Without dead ends: 201 [2020-02-10 20:14:17,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-02-10 20:14:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2020-02-10 20:14:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:14:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 419 transitions. [2020-02-10 20:14:17,593 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 419 transitions. Word has length 19 [2020-02-10 20:14:17,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:17,593 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 419 transitions. [2020-02-10 20:14:17,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 419 transitions. [2020-02-10 20:14:17,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:17,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:17,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:17,593 INFO L427 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:17,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2123535310, now seen corresponding path program 454 times [2020-02-10 20:14:17,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:17,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436533519] [2020-02-10 20:14:17,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:17,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:14:17,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436533519] [2020-02-10 20:14:17,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:17,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:17,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430103448] [2020-02-10 20:14:17,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:17,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:17,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:17,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:17,812 INFO L87 Difference]: Start difference. First operand 152 states and 419 transitions. Second operand 8 states. [2020-02-10 20:14:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:17,886 INFO L93 Difference]: Finished difference Result 204 states and 498 transitions. [2020-02-10 20:14:17,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:17,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:17,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:17,887 INFO L225 Difference]: With dead ends: 204 [2020-02-10 20:14:17,887 INFO L226 Difference]: Without dead ends: 190 [2020-02-10 20:14:17,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-02-10 20:14:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2020-02-10 20:14:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:14:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-02-10 20:14:17,891 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-02-10 20:14:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:17,891 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-02-10 20:14:17,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-02-10 20:14:17,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:17,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:17,891 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:17,892 INFO L427 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:17,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:17,892 INFO L82 PathProgramCache]: Analyzing trace with hash -107206542, now seen corresponding path program 455 times [2020-02-10 20:14:17,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:17,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060981520] [2020-02-10 20:14:17,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:18,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060981520] [2020-02-10 20:14:18,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:18,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:18,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333929679] [2020-02-10 20:14:18,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:18,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:18,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:18,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:18,111 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-02-10 20:14:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:18,166 INFO L93 Difference]: Finished difference Result 198 states and 486 transitions. [2020-02-10 20:14:18,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:18,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:18,167 INFO L225 Difference]: With dead ends: 198 [2020-02-10 20:14:18,168 INFO L226 Difference]: Without dead ends: 188 [2020-02-10 20:14:18,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-02-10 20:14:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 152. [2020-02-10 20:14:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:14:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-02-10 20:14:18,171 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-02-10 20:14:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:18,171 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-02-10 20:14:18,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-02-10 20:14:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:18,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:18,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:18,172 INFO L427 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash -962513196, now seen corresponding path program 456 times [2020-02-10 20:14:18,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:18,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899475839] [2020-02-10 20:14:18,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:18,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899475839] [2020-02-10 20:14:18,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:18,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:18,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677035621] [2020-02-10 20:14:18,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:18,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:18,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:18,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:18,377 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-02-10 20:14:18,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:18,445 INFO L93 Difference]: Finished difference Result 187 states and 472 transitions. [2020-02-10 20:14:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:18,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:18,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:18,446 INFO L225 Difference]: With dead ends: 187 [2020-02-10 20:14:18,446 INFO L226 Difference]: Without dead ends: 170 [2020-02-10 20:14:18,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-02-10 20:14:18,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 147. [2020-02-10 20:14:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:14:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 410 transitions. [2020-02-10 20:14:18,449 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 410 transitions. Word has length 19 [2020-02-10 20:14:18,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:18,449 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 410 transitions. [2020-02-10 20:14:18,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 410 transitions. [2020-02-10 20:14:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:18,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:18,450 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:18,450 INFO L427 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:18,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:18,450 INFO L82 PathProgramCache]: Analyzing trace with hash 915076246, now seen corresponding path program 457 times [2020-02-10 20:14:18,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:18,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081231910] [2020-02-10 20:14:18,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:18,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081231910] [2020-02-10 20:14:18,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:18,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:18,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936095898] [2020-02-10 20:14:18,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:18,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:18,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:18,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:18,642 INFO L87 Difference]: Start difference. First operand 147 states and 410 transitions. Second operand 8 states. [2020-02-10 20:14:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:18,722 INFO L93 Difference]: Finished difference Result 246 states and 578 transitions. [2020-02-10 20:14:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:18,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:18,723 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:14:18,723 INFO L226 Difference]: Without dead ends: 232 [2020-02-10 20:14:18,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-02-10 20:14:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 151. [2020-02-10 20:14:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:14:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 420 transitions. [2020-02-10 20:14:18,726 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 420 transitions. Word has length 19 [2020-02-10 20:14:18,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:18,727 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 420 transitions. [2020-02-10 20:14:18,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 420 transitions. [2020-02-10 20:14:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:18,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:18,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:18,727 INFO L427 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:18,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:18,728 INFO L82 PathProgramCache]: Analyzing trace with hash 40740920, now seen corresponding path program 458 times [2020-02-10 20:14:18,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:18,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212343587] [2020-02-10 20:14:18,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:18,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212343587] [2020-02-10 20:14:18,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:18,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:18,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989107643] [2020-02-10 20:14:18,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:18,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:18,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:18,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:18,921 INFO L87 Difference]: Start difference. First operand 151 states and 420 transitions. Second operand 8 states. [2020-02-10 20:14:19,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:19,002 INFO L93 Difference]: Finished difference Result 242 states and 567 transitions. [2020-02-10 20:14:19,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:19,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:19,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:19,003 INFO L225 Difference]: With dead ends: 242 [2020-02-10 20:14:19,003 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 20:14:19,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 20:14:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 149. [2020-02-10 20:14:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:14:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 416 transitions. [2020-02-10 20:14:19,007 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 416 transitions. Word has length 19 [2020-02-10 20:14:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:19,008 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 416 transitions. [2020-02-10 20:14:19,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 416 transitions. [2020-02-10 20:14:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:19,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:19,008 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:19,008 INFO L427 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:19,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2076098360, now seen corresponding path program 459 times [2020-02-10 20:14:19,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:19,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735842948] [2020-02-10 20:14:19,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:19,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735842948] [2020-02-10 20:14:19,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:19,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:19,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111860999] [2020-02-10 20:14:19,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:19,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:19,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:19,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:19,198 INFO L87 Difference]: Start difference. First operand 149 states and 416 transitions. Second operand 8 states. [2020-02-10 20:14:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:19,271 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-02-10 20:14:19,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:19,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:19,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:19,272 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:14:19,272 INFO L226 Difference]: Without dead ends: 232 [2020-02-10 20:14:19,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-02-10 20:14:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 151. [2020-02-10 20:14:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:14:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 419 transitions. [2020-02-10 20:14:19,276 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 419 transitions. Word has length 19 [2020-02-10 20:14:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:19,276 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 419 transitions. [2020-02-10 20:14:19,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 419 transitions. [2020-02-10 20:14:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:19,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:19,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:19,277 INFO L427 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:19,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:19,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1098739106, now seen corresponding path program 460 times [2020-02-10 20:14:19,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:19,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953765845] [2020-02-10 20:14:19,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:19,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953765845] [2020-02-10 20:14:19,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:19,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:19,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530534913] [2020-02-10 20:14:19,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:19,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:19,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:19,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:19,475 INFO L87 Difference]: Start difference. First operand 151 states and 419 transitions. Second operand 8 states. [2020-02-10 20:14:19,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:19,539 INFO L93 Difference]: Finished difference Result 242 states and 566 transitions. [2020-02-10 20:14:19,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:19,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:19,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:19,541 INFO L225 Difference]: With dead ends: 242 [2020-02-10 20:14:19,541 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 20:14:19,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 20:14:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 149. [2020-02-10 20:14:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:14:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 415 transitions. [2020-02-10 20:14:19,545 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 415 transitions. Word has length 19 [2020-02-10 20:14:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:19,545 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 415 transitions. [2020-02-10 20:14:19,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 415 transitions. [2020-02-10 20:14:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:19,546 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:19,546 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:19,546 INFO L427 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:19,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:19,546 INFO L82 PathProgramCache]: Analyzing trace with hash -321241190, now seen corresponding path program 461 times [2020-02-10 20:14:19,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:19,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980796744] [2020-02-10 20:14:19,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:19,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980796744] [2020-02-10 20:14:19,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:19,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:19,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542972487] [2020-02-10 20:14:19,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:19,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:19,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:19,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:19,751 INFO L87 Difference]: Start difference. First operand 149 states and 415 transitions. Second operand 8 states. [2020-02-10 20:14:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:19,830 INFO L93 Difference]: Finished difference Result 237 states and 555 transitions. [2020-02-10 20:14:19,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:19,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:19,831 INFO L225 Difference]: With dead ends: 237 [2020-02-10 20:14:19,831 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 20:14:19,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 20:14:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 150. [2020-02-10 20:14:19,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:14:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-02-10 20:14:19,835 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-02-10 20:14:19,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:19,835 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-02-10 20:14:19,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:19,836 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-02-10 20:14:19,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:19,836 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:19,836 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:19,836 INFO L427 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash -560883528, now seen corresponding path program 462 times [2020-02-10 20:14:19,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:19,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221735500] [2020-02-10 20:14:19,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:20,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221735500] [2020-02-10 20:14:20,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:20,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:20,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727100617] [2020-02-10 20:14:20,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:20,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:20,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:20,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:20,041 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-02-10 20:14:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:20,109 INFO L93 Difference]: Finished difference Result 237 states and 554 transitions. [2020-02-10 20:14:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:20,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:20,110 INFO L225 Difference]: With dead ends: 237 [2020-02-10 20:14:20,110 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:14:20,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:14:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 148. [2020-02-10 20:14:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-02-10 20:14:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 413 transitions. [2020-02-10 20:14:20,114 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 413 transitions. Word has length 19 [2020-02-10 20:14:20,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:20,115 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 413 transitions. [2020-02-10 20:14:20,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 413 transitions. [2020-02-10 20:14:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:20,115 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:20,115 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:20,115 INFO L427 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:20,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash -695864712, now seen corresponding path program 463 times [2020-02-10 20:14:20,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:20,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523453915] [2020-02-10 20:14:20,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:20,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523453915] [2020-02-10 20:14:20,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:20,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:20,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127926947] [2020-02-10 20:14:20,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:20,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:20,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:20,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:20,291 INFO L87 Difference]: Start difference. First operand 148 states and 413 transitions. Second operand 8 states. [2020-02-10 20:14:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:20,370 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-02-10 20:14:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:20,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:20,371 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:14:20,371 INFO L226 Difference]: Without dead ends: 232 [2020-02-10 20:14:20,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:20,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-02-10 20:14:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2020-02-10 20:14:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:14:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-02-10 20:14:20,375 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-02-10 20:14:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:20,375 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-02-10 20:14:20,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-02-10 20:14:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:20,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:20,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:20,376 INFO L427 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:20,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:20,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1570200038, now seen corresponding path program 464 times [2020-02-10 20:14:20,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:20,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085266183] [2020-02-10 20:14:20,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:20,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085266183] [2020-02-10 20:14:20,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:20,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:20,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637380437] [2020-02-10 20:14:20,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:20,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:20,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:20,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:20,554 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-02-10 20:14:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:20,636 INFO L93 Difference]: Finished difference Result 242 states and 566 transitions. [2020-02-10 20:14:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:20,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:20,637 INFO L225 Difference]: With dead ends: 242 [2020-02-10 20:14:20,637 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 20:14:20,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 20:14:20,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 150. [2020-02-10 20:14:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:14:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 418 transitions. [2020-02-10 20:14:20,641 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 418 transitions. Word has length 19 [2020-02-10 20:14:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:20,642 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 418 transitions. [2020-02-10 20:14:20,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 418 transitions. [2020-02-10 20:14:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:20,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:20,642 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:20,642 INFO L427 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:20,642 INFO L82 PathProgramCache]: Analyzing trace with hash 793540284, now seen corresponding path program 465 times [2020-02-10 20:14:20,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:20,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386026225] [2020-02-10 20:14:20,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:20,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386026225] [2020-02-10 20:14:20,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:20,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:20,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909559912] [2020-02-10 20:14:20,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:20,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:20,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:20,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:20,821 INFO L87 Difference]: Start difference. First operand 150 states and 418 transitions. Second operand 8 states. [2020-02-10 20:14:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:20,899 INFO L93 Difference]: Finished difference Result 244 states and 575 transitions. [2020-02-10 20:14:20,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:20,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:20,901 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:14:20,901 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 20:14:20,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 20:14:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 154. [2020-02-10 20:14:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:14:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 426 transitions. [2020-02-10 20:14:20,905 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 426 transitions. Word has length 19 [2020-02-10 20:14:20,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:20,905 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 426 transitions. [2020-02-10 20:14:20,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:20,905 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 426 transitions. [2020-02-10 20:14:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:20,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:20,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:20,906 INFO L427 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:20,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:20,906 INFO L82 PathProgramCache]: Analyzing trace with hash 48243140, now seen corresponding path program 466 times [2020-02-10 20:14:20,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:20,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020352424] [2020-02-10 20:14:20,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:21,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020352424] [2020-02-10 20:14:21,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:21,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:21,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92423339] [2020-02-10 20:14:21,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:21,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:21,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:21,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:21,079 INFO L87 Difference]: Start difference. First operand 154 states and 426 transitions. Second operand 8 states. [2020-02-10 20:14:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:21,156 INFO L93 Difference]: Finished difference Result 233 states and 558 transitions. [2020-02-10 20:14:21,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:21,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:21,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:21,157 INFO L225 Difference]: With dead ends: 233 [2020-02-10 20:14:21,157 INFO L226 Difference]: Without dead ends: 217 [2020-02-10 20:14:21,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-02-10 20:14:21,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 150. [2020-02-10 20:14:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:14:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-02-10 20:14:21,161 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-02-10 20:14:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:21,161 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-02-10 20:14:21,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-02-10 20:14:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:21,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:21,162 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:21,162 INFO L427 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2141654844, now seen corresponding path program 467 times [2020-02-10 20:14:21,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:21,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274068515] [2020-02-10 20:14:21,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:21,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274068515] [2020-02-10 20:14:21,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:21,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:21,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952123855] [2020-02-10 20:14:21,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:21,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:21,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:21,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:21,341 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-02-10 20:14:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:21,414 INFO L93 Difference]: Finished difference Result 238 states and 557 transitions. [2020-02-10 20:14:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:21,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:21,414 INFO L225 Difference]: With dead ends: 238 [2020-02-10 20:14:21,414 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:14:21,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:14:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 152. [2020-02-10 20:14:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:14:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 419 transitions. [2020-02-10 20:14:21,418 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 419 transitions. Word has length 19 [2020-02-10 20:14:21,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:21,418 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 419 transitions. [2020-02-10 20:14:21,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 419 transitions. [2020-02-10 20:14:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:21,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:21,418 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:21,419 INFO L427 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:21,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:21,419 INFO L82 PathProgramCache]: Analyzing trace with hash -431041536, now seen corresponding path program 468 times [2020-02-10 20:14:21,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:21,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855902228] [2020-02-10 20:14:21,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:21,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855902228] [2020-02-10 20:14:21,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:21,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:21,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703139581] [2020-02-10 20:14:21,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:21,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:21,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:21,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:21,600 INFO L87 Difference]: Start difference. First operand 152 states and 419 transitions. Second operand 8 states. [2020-02-10 20:14:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:21,686 INFO L93 Difference]: Finished difference Result 231 states and 551 transitions. [2020-02-10 20:14:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:21,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:21,688 INFO L225 Difference]: With dead ends: 231 [2020-02-10 20:14:21,688 INFO L226 Difference]: Without dead ends: 215 [2020-02-10 20:14:21,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-02-10 20:14:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 148. [2020-02-10 20:14:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-02-10 20:14:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 412 transitions. [2020-02-10 20:14:21,692 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 412 transitions. Word has length 19 [2020-02-10 20:14:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:21,692 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 412 transitions. [2020-02-10 20:14:21,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 412 transitions. [2020-02-10 20:14:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:21,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:21,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:21,693 INFO L427 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:21,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1124777348, now seen corresponding path program 469 times [2020-02-10 20:14:21,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:21,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721326299] [2020-02-10 20:14:21,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:21,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721326299] [2020-02-10 20:14:21,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:21,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:21,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078203374] [2020-02-10 20:14:21,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:21,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:21,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:21,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:21,870 INFO L87 Difference]: Start difference. First operand 148 states and 412 transitions. Second operand 8 states. [2020-02-10 20:14:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:21,942 INFO L93 Difference]: Finished difference Result 236 states and 552 transitions. [2020-02-10 20:14:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:21,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:21,943 INFO L225 Difference]: With dead ends: 236 [2020-02-10 20:14:21,943 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 20:14:21,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 20:14:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 152. [2020-02-10 20:14:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:14:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 422 transitions. [2020-02-10 20:14:21,947 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 422 transitions. Word has length 19 [2020-02-10 20:14:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:21,947 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 422 transitions. [2020-02-10 20:14:21,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 422 transitions. [2020-02-10 20:14:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:21,948 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:21,948 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:21,948 INFO L427 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash -4647518, now seen corresponding path program 470 times [2020-02-10 20:14:21,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:21,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761615721] [2020-02-10 20:14:21,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:22,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761615721] [2020-02-10 20:14:22,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:22,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:22,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764903094] [2020-02-10 20:14:22,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:22,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:22,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:22,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:22,134 INFO L87 Difference]: Start difference. First operand 152 states and 422 transitions. Second operand 8 states. [2020-02-10 20:14:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:22,194 INFO L93 Difference]: Finished difference Result 232 states and 541 transitions. [2020-02-10 20:14:22,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:22,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:22,195 INFO L225 Difference]: With dead ends: 232 [2020-02-10 20:14:22,195 INFO L226 Difference]: Without dead ends: 220 [2020-02-10 20:14:22,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-02-10 20:14:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 150. [2020-02-10 20:14:22,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:14:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 417 transitions. [2020-02-10 20:14:22,199 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 417 transitions. Word has length 19 [2020-02-10 20:14:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:22,199 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 417 transitions. [2020-02-10 20:14:22,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 417 transitions. [2020-02-10 20:14:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:22,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:22,200 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:22,200 INFO L427 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:22,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:22,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1869479846, now seen corresponding path program 471 times [2020-02-10 20:14:22,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:22,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761238659] [2020-02-10 20:14:22,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:22,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761238659] [2020-02-10 20:14:22,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:22,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:22,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640833713] [2020-02-10 20:14:22,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:22,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:22,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:22,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:22,375 INFO L87 Difference]: Start difference. First operand 150 states and 417 transitions. Second operand 8 states. [2020-02-10 20:14:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:22,453 INFO L93 Difference]: Finished difference Result 230 states and 538 transitions. [2020-02-10 20:14:22,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:22,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:22,454 INFO L225 Difference]: With dead ends: 230 [2020-02-10 20:14:22,454 INFO L226 Difference]: Without dead ends: 216 [2020-02-10 20:14:22,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-02-10 20:14:22,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 154. [2020-02-10 20:14:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 20:14:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 425 transitions. [2020-02-10 20:14:22,458 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 425 transitions. Word has length 19 [2020-02-10 20:14:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:22,458 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 425 transitions. [2020-02-10 20:14:22,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 425 transitions. [2020-02-10 20:14:22,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:22,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:22,459 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:22,459 INFO L427 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:22,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:22,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1680190306, now seen corresponding path program 472 times [2020-02-10 20:14:22,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:22,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610000347] [2020-02-10 20:14:22,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:22,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610000347] [2020-02-10 20:14:22,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:22,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:22,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207306958] [2020-02-10 20:14:22,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:22,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:22,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:22,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:22,638 INFO L87 Difference]: Start difference. First operand 154 states and 425 transitions. Second operand 8 states. [2020-02-10 20:14:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:22,717 INFO L93 Difference]: Finished difference Result 219 states and 521 transitions. [2020-02-10 20:14:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:22,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:22,718 INFO L225 Difference]: With dead ends: 219 [2020-02-10 20:14:22,719 INFO L226 Difference]: Without dead ends: 203 [2020-02-10 20:14:22,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-02-10 20:14:22,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-02-10 20:14:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:14:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-02-10 20:14:22,722 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-02-10 20:14:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:22,722 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-02-10 20:14:22,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-02-10 20:14:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:22,723 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:22,723 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:22,723 INFO L427 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:22,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:22,723 INFO L82 PathProgramCache]: Analyzing trace with hash -539877320, now seen corresponding path program 473 times [2020-02-10 20:14:22,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:22,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563333759] [2020-02-10 20:14:22,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:22,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563333759] [2020-02-10 20:14:22,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:22,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:22,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11924873] [2020-02-10 20:14:22,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:22,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:22,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:22,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:22,908 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-02-10 20:14:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:22,974 INFO L93 Difference]: Finished difference Result 215 states and 511 transitions. [2020-02-10 20:14:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:22,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:22,975 INFO L225 Difference]: With dead ends: 215 [2020-02-10 20:14:22,975 INFO L226 Difference]: Without dead ends: 205 [2020-02-10 20:14:22,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-02-10 20:14:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 152. [2020-02-10 20:14:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:14:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-02-10 20:14:22,979 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-02-10 20:14:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:22,979 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-02-10 20:14:22,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:22,979 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-02-10 20:14:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:22,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:22,980 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:22,980 INFO L427 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:22,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1395183974, now seen corresponding path program 474 times [2020-02-10 20:14:22,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:22,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095394763] [2020-02-10 20:14:22,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:23,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095394763] [2020-02-10 20:14:23,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:23,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:23,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419861574] [2020-02-10 20:14:23,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:23,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:23,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:23,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:23,162 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-02-10 20:14:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:23,235 INFO L93 Difference]: Finished difference Result 204 states and 497 transitions. [2020-02-10 20:14:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:23,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:23,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:23,236 INFO L225 Difference]: With dead ends: 204 [2020-02-10 20:14:23,236 INFO L226 Difference]: Without dead ends: 188 [2020-02-10 20:14:23,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-02-10 20:14:23,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 148. [2020-02-10 20:14:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-02-10 20:14:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 411 transitions. [2020-02-10 20:14:23,240 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 411 transitions. Word has length 19 [2020-02-10 20:14:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:23,240 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 411 transitions. [2020-02-10 20:14:23,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 411 transitions. [2020-02-10 20:14:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:23,241 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:23,241 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:23,241 INFO L427 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:23,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:23,241 INFO L82 PathProgramCache]: Analyzing trace with hash 266504132, now seen corresponding path program 475 times [2020-02-10 20:14:23,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:23,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562044842] [2020-02-10 20:14:23,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:23,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562044842] [2020-02-10 20:14:23,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:23,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:23,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252394013] [2020-02-10 20:14:23,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:23,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:23,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:23,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:23,471 INFO L87 Difference]: Start difference. First operand 148 states and 411 transitions. Second operand 8 states. [2020-02-10 20:14:23,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:23,545 INFO L93 Difference]: Finished difference Result 213 states and 507 transitions. [2020-02-10 20:14:23,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:23,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:23,546 INFO L225 Difference]: With dead ends: 213 [2020-02-10 20:14:23,546 INFO L226 Difference]: Without dead ends: 203 [2020-02-10 20:14:23,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-02-10 20:14:23,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-02-10 20:14:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:14:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-02-10 20:14:23,549 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-02-10 20:14:23,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:23,549 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-02-10 20:14:23,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-02-10 20:14:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:23,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:23,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:23,550 INFO L427 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:23,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:23,550 INFO L82 PathProgramCache]: Analyzing trace with hash 26861794, now seen corresponding path program 476 times [2020-02-10 20:14:23,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:23,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987457576] [2020-02-10 20:14:23,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:23,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987457576] [2020-02-10 20:14:23,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:23,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:23,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756561303] [2020-02-10 20:14:23,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:23,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:23,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:23,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:23,757 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-02-10 20:14:23,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:23,820 INFO L93 Difference]: Finished difference Result 213 states and 506 transitions. [2020-02-10 20:14:23,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:23,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:23,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:23,821 INFO L225 Difference]: With dead ends: 213 [2020-02-10 20:14:23,821 INFO L226 Difference]: Without dead ends: 202 [2020-02-10 20:14:23,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-02-10 20:14:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 149. [2020-02-10 20:14:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:14:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 413 transitions. [2020-02-10 20:14:23,825 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 413 transitions. Word has length 19 [2020-02-10 20:14:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:23,825 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 413 transitions. [2020-02-10 20:14:23,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 413 transitions. [2020-02-10 20:14:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:23,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:23,825 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:23,826 INFO L427 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:23,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:23,826 INFO L82 PathProgramCache]: Analyzing trace with hash -478198366, now seen corresponding path program 477 times [2020-02-10 20:14:23,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:23,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125824807] [2020-02-10 20:14:23,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:24,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125824807] [2020-02-10 20:14:24,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:24,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:24,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354429414] [2020-02-10 20:14:24,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:24,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:24,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:24,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:24,023 INFO L87 Difference]: Start difference. First operand 149 states and 413 transitions. Second operand 8 states. [2020-02-10 20:14:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:24,100 INFO L93 Difference]: Finished difference Result 210 states and 501 transitions. [2020-02-10 20:14:24,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:24,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:24,101 INFO L225 Difference]: With dead ends: 210 [2020-02-10 20:14:24,101 INFO L226 Difference]: Without dead ends: 200 [2020-02-10 20:14:24,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-02-10 20:14:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 151. [2020-02-10 20:14:24,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:14:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 416 transitions. [2020-02-10 20:14:24,105 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 416 transitions. Word has length 19 [2020-02-10 20:14:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:24,106 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 416 transitions. [2020-02-10 20:14:24,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 416 transitions. [2020-02-10 20:14:24,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:24,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:24,106 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:24,106 INFO L427 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:24,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:24,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1232414942, now seen corresponding path program 478 times [2020-02-10 20:14:24,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:24,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145636597] [2020-02-10 20:14:24,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:24,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145636597] [2020-02-10 20:14:24,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:24,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:24,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357888321] [2020-02-10 20:14:24,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:24,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:24,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:24,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:24,308 INFO L87 Difference]: Start difference. First operand 151 states and 416 transitions. Second operand 8 states. [2020-02-10 20:14:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:24,384 INFO L93 Difference]: Finished difference Result 203 states and 495 transitions. [2020-02-10 20:14:24,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:24,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:24,385 INFO L225 Difference]: With dead ends: 203 [2020-02-10 20:14:24,385 INFO L226 Difference]: Without dead ends: 189 [2020-02-10 20:14:24,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-02-10 20:14:24,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 149. [2020-02-10 20:14:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:14:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 412 transitions. [2020-02-10 20:14:24,389 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 412 transitions. Word has length 19 [2020-02-10 20:14:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:24,390 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 412 transitions. [2020-02-10 20:14:24,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 412 transitions. [2020-02-10 20:14:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:24,390 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:24,390 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:24,390 INFO L427 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:24,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:24,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1046223586, now seen corresponding path program 479 times [2020-02-10 20:14:24,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:24,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631998019] [2020-02-10 20:14:24,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:24,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:14:24,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631998019] [2020-02-10 20:14:24,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:24,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:24,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496715415] [2020-02-10 20:14:24,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:24,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:24,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:24,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:24,587 INFO L87 Difference]: Start difference. First operand 149 states and 412 transitions. Second operand 8 states. [2020-02-10 20:14:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:24,648 INFO L93 Difference]: Finished difference Result 197 states and 483 transitions. [2020-02-10 20:14:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:24,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:24,649 INFO L225 Difference]: With dead ends: 197 [2020-02-10 20:14:24,649 INFO L226 Difference]: Without dead ends: 187 [2020-02-10 20:14:24,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-02-10 20:14:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 151. [2020-02-10 20:14:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 20:14:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 415 transitions. [2020-02-10 20:14:24,653 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 415 transitions. Word has length 19 [2020-02-10 20:14:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:24,654 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 415 transitions. [2020-02-10 20:14:24,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 415 transitions. [2020-02-10 20:14:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:24,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:24,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:24,654 INFO L427 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:24,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:24,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1901530240, now seen corresponding path program 480 times [2020-02-10 20:14:24,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:24,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700967140] [2020-02-10 20:14:24,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:24,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700967140] [2020-02-10 20:14:24,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:24,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:24,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253659530] [2020-02-10 20:14:24,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:24,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:24,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:24,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:24,847 INFO L87 Difference]: Start difference. First operand 151 states and 415 transitions. Second operand 8 states. [2020-02-10 20:14:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:24,916 INFO L93 Difference]: Finished difference Result 186 states and 469 transitions. [2020-02-10 20:14:24,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:24,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:24,917 INFO L225 Difference]: With dead ends: 186 [2020-02-10 20:14:24,917 INFO L226 Difference]: Without dead ends: 167 [2020-02-10 20:14:24,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:24,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-02-10 20:14:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144. [2020-02-10 20:14:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-02-10 20:14:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 404 transitions. [2020-02-10 20:14:24,920 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 404 transitions. Word has length 19 [2020-02-10 20:14:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:24,921 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 404 transitions. [2020-02-10 20:14:24,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 404 transitions. [2020-02-10 20:14:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:24,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:24,921 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:24,921 INFO L427 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:24,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:24,921 INFO L82 PathProgramCache]: Analyzing trace with hash -700822424, now seen corresponding path program 481 times [2020-02-10 20:14:24,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:24,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702796392] [2020-02-10 20:14:24,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:25,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702796392] [2020-02-10 20:14:25,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:25,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:25,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193786027] [2020-02-10 20:14:25,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:25,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:25,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:25,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:25,128 INFO L87 Difference]: Start difference. First operand 144 states and 404 transitions. Second operand 8 states. [2020-02-10 20:14:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:25,187 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-02-10 20:14:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:25,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:25,188 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:14:25,188 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:14:25,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:14:25,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-02-10 20:14:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:14:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 414 transitions. [2020-02-10 20:14:25,194 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 414 transitions. Word has length 19 [2020-02-10 20:14:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:25,194 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 414 transitions. [2020-02-10 20:14:25,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 414 transitions. [2020-02-10 20:14:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:25,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:25,195 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:25,195 INFO L427 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:25,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:25,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1442418326, now seen corresponding path program 482 times [2020-02-10 20:14:25,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:25,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191970825] [2020-02-10 20:14:25,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:25,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191970825] [2020-02-10 20:14:25,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:25,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:25,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775826308] [2020-02-10 20:14:25,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:25,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:25,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:25,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:25,410 INFO L87 Difference]: Start difference. First operand 149 states and 414 transitions. Second operand 8 states. [2020-02-10 20:14:25,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:25,487 INFO L93 Difference]: Finished difference Result 238 states and 545 transitions. [2020-02-10 20:14:25,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:25,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:25,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:25,488 INFO L225 Difference]: With dead ends: 238 [2020-02-10 20:14:25,488 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:14:25,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:25,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:14:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2020-02-10 20:14:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 20:14:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 408 transitions. [2020-02-10 20:14:25,492 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 408 transitions. Word has length 19 [2020-02-10 20:14:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:25,492 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 408 transitions. [2020-02-10 20:14:25,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 408 transitions. [2020-02-10 20:14:25,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:25,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:25,493 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:25,493 INFO L427 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1993707018, now seen corresponding path program 483 times [2020-02-10 20:14:25,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:25,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746419652] [2020-02-10 20:14:25,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:25,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746419652] [2020-02-10 20:14:25,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:25,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:25,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595137619] [2020-02-10 20:14:25,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:25,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:25,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:25,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:25,699 INFO L87 Difference]: Start difference. First operand 146 states and 408 transitions. Second operand 8 states. [2020-02-10 20:14:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:25,756 INFO L93 Difference]: Finished difference Result 244 states and 558 transitions. [2020-02-10 20:14:25,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:25,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:25,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:25,757 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:14:25,757 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:14:25,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:25,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:14:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-02-10 20:14:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:14:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 412 transitions. [2020-02-10 20:14:25,762 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 412 transitions. Word has length 19 [2020-02-10 20:14:25,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:25,762 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 412 transitions. [2020-02-10 20:14:25,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 412 transitions. [2020-02-10 20:14:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:25,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:25,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:25,763 INFO L427 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:25,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:25,763 INFO L82 PathProgramCache]: Analyzing trace with hash -2042202052, now seen corresponding path program 484 times [2020-02-10 20:14:25,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:25,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269178720] [2020-02-10 20:14:25,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:25,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:14:25,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269178720] [2020-02-10 20:14:25,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:25,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:25,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333893885] [2020-02-10 20:14:25,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:25,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:25,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:25,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:25,991 INFO L87 Difference]: Start difference. First operand 149 states and 412 transitions. Second operand 8 states. [2020-02-10 20:14:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:26,051 INFO L93 Difference]: Finished difference Result 238 states and 543 transitions. [2020-02-10 20:14:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:26,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:26,052 INFO L225 Difference]: With dead ends: 238 [2020-02-10 20:14:26,052 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:14:26,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:14:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2020-02-10 20:14:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 20:14:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 406 transitions. [2020-02-10 20:14:26,057 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 406 transitions. Word has length 19 [2020-02-10 20:14:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:26,057 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 406 transitions. [2020-02-10 20:14:26,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 406 transitions. [2020-02-10 20:14:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:26,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:26,057 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:26,058 INFO L427 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:26,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:26,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1012326922, now seen corresponding path program 485 times [2020-02-10 20:14:26,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:26,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989191692] [2020-02-10 20:14:26,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:26,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989191692] [2020-02-10 20:14:26,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:26,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:26,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050633583] [2020-02-10 20:14:26,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:26,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:26,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:26,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:26,269 INFO L87 Difference]: Start difference. First operand 146 states and 406 transitions. Second operand 8 states. [2020-02-10 20:14:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:26,345 INFO L93 Difference]: Finished difference Result 230 states and 527 transitions. [2020-02-10 20:14:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:26,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:26,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:26,347 INFO L225 Difference]: With dead ends: 230 [2020-02-10 20:14:26,347 INFO L226 Difference]: Without dead ends: 220 [2020-02-10 20:14:26,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-02-10 20:14:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 147. [2020-02-10 20:14:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:14:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 407 transitions. [2020-02-10 20:14:26,350 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 407 transitions. Word has length 19 [2020-02-10 20:14:26,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:26,351 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 407 transitions. [2020-02-10 20:14:26,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 407 transitions. [2020-02-10 20:14:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:26,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:26,351 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:26,351 INFO L427 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:26,351 INFO L82 PathProgramCache]: Analyzing trace with hash 772684584, now seen corresponding path program 486 times [2020-02-10 20:14:26,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:26,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119924282] [2020-02-10 20:14:26,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:26,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119924282] [2020-02-10 20:14:26,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:26,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:26,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919261544] [2020-02-10 20:14:26,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:26,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:26,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:26,569 INFO L87 Difference]: Start difference. First operand 147 states and 407 transitions. Second operand 8 states. [2020-02-10 20:14:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:26,630 INFO L93 Difference]: Finished difference Result 230 states and 526 transitions. [2020-02-10 20:14:26,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:26,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:26,632 INFO L225 Difference]: With dead ends: 230 [2020-02-10 20:14:26,632 INFO L226 Difference]: Without dead ends: 217 [2020-02-10 20:14:26,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-02-10 20:14:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 144. [2020-02-10 20:14:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-02-10 20:14:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 402 transitions. [2020-02-10 20:14:26,635 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 402 transitions. Word has length 19 [2020-02-10 20:14:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:26,635 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 402 transitions. [2020-02-10 20:14:26,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 402 transitions. [2020-02-10 20:14:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:26,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:26,636 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:26,636 INFO L427 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:26,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:26,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1225211654, now seen corresponding path program 487 times [2020-02-10 20:14:26,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:26,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587906480] [2020-02-10 20:14:26,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:26,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587906480] [2020-02-10 20:14:26,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:26,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:26,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438325224] [2020-02-10 20:14:26,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:26,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:26,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:26,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:26,841 INFO L87 Difference]: Start difference. First operand 144 states and 402 transitions. Second operand 8 states. [2020-02-10 20:14:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:26,900 INFO L93 Difference]: Finished difference Result 250 states and 577 transitions. [2020-02-10 20:14:26,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:26,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:26,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:26,901 INFO L225 Difference]: With dead ends: 250 [2020-02-10 20:14:26,902 INFO L226 Difference]: Without dead ends: 234 [2020-02-10 20:14:26,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-02-10 20:14:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 150. [2020-02-10 20:14:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:14:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-02-10 20:14:26,905 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-02-10 20:14:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:26,906 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-02-10 20:14:26,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-02-10 20:14:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:26,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:26,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:26,906 INFO L427 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:26,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:26,907 INFO L82 PathProgramCache]: Analyzing trace with hash -926514892, now seen corresponding path program 488 times [2020-02-10 20:14:26,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:26,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943303627] [2020-02-10 20:14:26,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:27,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943303627] [2020-02-10 20:14:27,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:27,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:27,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615509720] [2020-02-10 20:14:27,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:27,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:27,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:27,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:27,108 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-02-10 20:14:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:27,186 INFO L93 Difference]: Finished difference Result 244 states and 562 transitions. [2020-02-10 20:14:27,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:27,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:27,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:27,187 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:14:27,187 INFO L226 Difference]: Without dead ends: 231 [2020-02-10 20:14:27,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-02-10 20:14:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 147. [2020-02-10 20:14:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:14:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 409 transitions. [2020-02-10 20:14:27,191 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 409 transitions. Word has length 19 [2020-02-10 20:14:27,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:27,191 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 409 transitions. [2020-02-10 20:14:27,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 409 transitions. [2020-02-10 20:14:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:27,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:27,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:27,191 INFO L427 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:27,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:27,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1975664054, now seen corresponding path program 489 times [2020-02-10 20:14:27,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:27,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485620094] [2020-02-10 20:14:27,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:27,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485620094] [2020-02-10 20:14:27,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:27,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:27,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987877597] [2020-02-10 20:14:27,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:27,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:27,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:27,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:27,405 INFO L87 Difference]: Start difference. First operand 147 states and 409 transitions. Second operand 8 states. [2020-02-10 20:14:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:27,462 INFO L93 Difference]: Finished difference Result 254 states and 586 transitions. [2020-02-10 20:14:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:27,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:27,463 INFO L225 Difference]: With dead ends: 254 [2020-02-10 20:14:27,463 INFO L226 Difference]: Without dead ends: 238 [2020-02-10 20:14:27,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-02-10 20:14:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2020-02-10 20:14:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:14:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-02-10 20:14:27,467 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-02-10 20:14:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:27,467 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-02-10 20:14:27,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-02-10 20:14:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:27,468 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:27,468 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:27,468 INFO L427 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:27,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:27,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1568241148, now seen corresponding path program 490 times [2020-02-10 20:14:27,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:27,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970922839] [2020-02-10 20:14:27,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:27,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970922839] [2020-02-10 20:14:27,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:27,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:27,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749753612] [2020-02-10 20:14:27,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:27,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:27,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:27,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:27,680 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-02-10 20:14:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:27,755 INFO L93 Difference]: Finished difference Result 250 states and 574 transitions. [2020-02-10 20:14:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:27,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:27,756 INFO L225 Difference]: With dead ends: 250 [2020-02-10 20:14:27,756 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 20:14:27,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 20:14:27,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 147. [2020-02-10 20:14:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:14:27,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 406 transitions. [2020-02-10 20:14:27,760 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 406 transitions. Word has length 19 [2020-02-10 20:14:27,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:27,760 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 406 transitions. [2020-02-10 20:14:27,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 406 transitions. [2020-02-10 20:14:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:27,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:27,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:27,761 INFO L427 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:27,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1566078992, now seen corresponding path program 491 times [2020-02-10 20:14:27,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:27,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804937560] [2020-02-10 20:14:27,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:27,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804937560] [2020-02-10 20:14:27,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:27,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:27,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339343347] [2020-02-10 20:14:27,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:27,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:27,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:27,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:27,969 INFO L87 Difference]: Start difference. First operand 147 states and 406 transitions. Second operand 8 states. [2020-02-10 20:14:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:28,048 INFO L93 Difference]: Finished difference Result 239 states and 550 transitions. [2020-02-10 20:14:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:28,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:28,049 INFO L225 Difference]: With dead ends: 239 [2020-02-10 20:14:28,049 INFO L226 Difference]: Without dead ends: 229 [2020-02-10 20:14:28,050 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-02-10 20:14:28,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 149. [2020-02-10 20:14:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:14:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 409 transitions. [2020-02-10 20:14:28,053 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 409 transitions. Word has length 19 [2020-02-10 20:14:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:28,053 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 409 transitions. [2020-02-10 20:14:28,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 409 transitions. [2020-02-10 20:14:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:28,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:28,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:28,054 INFO L427 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:28,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:28,054 INFO L82 PathProgramCache]: Analyzing trace with hash 144534316, now seen corresponding path program 492 times [2020-02-10 20:14:28,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:28,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828575082] [2020-02-10 20:14:28,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:28,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:14:28,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828575082] [2020-02-10 20:14:28,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:28,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:28,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417369484] [2020-02-10 20:14:28,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:28,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:28,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:28,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:28,265 INFO L87 Difference]: Start difference. First operand 149 states and 409 transitions. Second operand 8 states. [2020-02-10 20:14:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:28,354 INFO L93 Difference]: Finished difference Result 241 states and 553 transitions. [2020-02-10 20:14:28,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:28,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:28,355 INFO L225 Difference]: With dead ends: 241 [2020-02-10 20:14:28,355 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 20:14:28,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:28,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 20:14:28,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2020-02-10 20:14:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-02-10 20:14:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 400 transitions. [2020-02-10 20:14:28,359 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 400 transitions. Word has length 19 [2020-02-10 20:14:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:28,359 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 400 transitions. [2020-02-10 20:14:28,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 400 transitions. [2020-02-10 20:14:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:28,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:28,360 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:28,360 INFO L427 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1550807878, now seen corresponding path program 493 times [2020-02-10 20:14:28,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:28,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483388746] [2020-02-10 20:14:28,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:28,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483388746] [2020-02-10 20:14:28,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:28,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:28,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763022654] [2020-02-10 20:14:28,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:28,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:28,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:28,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:28,567 INFO L87 Difference]: Start difference. First operand 144 states and 400 transitions. Second operand 8 states. [2020-02-10 20:14:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:28,629 INFO L93 Difference]: Finished difference Result 250 states and 575 transitions. [2020-02-10 20:14:28,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:28,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:28,630 INFO L225 Difference]: With dead ends: 250 [2020-02-10 20:14:28,630 INFO L226 Difference]: Without dead ends: 234 [2020-02-10 20:14:28,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-02-10 20:14:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 150. [2020-02-10 20:14:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 20:14:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 414 transitions. [2020-02-10 20:14:28,635 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 414 transitions. Word has length 19 [2020-02-10 20:14:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:28,635 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 414 transitions. [2020-02-10 20:14:28,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 414 transitions. [2020-02-10 20:14:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:28,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:28,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:28,635 INFO L427 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1809866104, now seen corresponding path program 494 times [2020-02-10 20:14:28,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:28,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374422809] [2020-02-10 20:14:28,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:28,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374422809] [2020-02-10 20:14:28,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:28,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:28,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156335110] [2020-02-10 20:14:28,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:28,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:28,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:28,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:28,845 INFO L87 Difference]: Start difference. First operand 150 states and 414 transitions. Second operand 8 states. [2020-02-10 20:14:28,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:28,910 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-02-10 20:14:28,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:28,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:28,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:28,911 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:14:28,911 INFO L226 Difference]: Without dead ends: 231 [2020-02-10 20:14:28,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-02-10 20:14:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 147. [2020-02-10 20:14:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:14:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 407 transitions. [2020-02-10 20:14:28,915 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 407 transitions. Word has length 19 [2020-02-10 20:14:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:28,915 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 407 transitions. [2020-02-10 20:14:28,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 407 transitions. [2020-02-10 20:14:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:28,915 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:28,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:28,916 INFO L427 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:28,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:28,916 INFO L82 PathProgramCache]: Analyzing trace with hash -49629976, now seen corresponding path program 495 times [2020-02-10 20:14:28,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:28,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475960279] [2020-02-10 20:14:28,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:29,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475960279] [2020-02-10 20:14:29,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:29,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:29,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490121361] [2020-02-10 20:14:29,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:29,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:29,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:29,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:29,138 INFO L87 Difference]: Start difference. First operand 147 states and 407 transitions. Second operand 8 states. [2020-02-10 20:14:29,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:29,201 INFO L93 Difference]: Finished difference Result 254 states and 584 transitions. [2020-02-10 20:14:29,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:29,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:29,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:29,202 INFO L225 Difference]: With dead ends: 254 [2020-02-10 20:14:29,202 INFO L226 Difference]: Without dead ends: 238 [2020-02-10 20:14:29,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-02-10 20:14:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2020-02-10 20:14:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 20:14:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 416 transitions. [2020-02-10 20:14:29,207 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 416 transitions. Word has length 19 [2020-02-10 20:14:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:29,207 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 416 transitions. [2020-02-10 20:14:29,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 416 transitions. [2020-02-10 20:14:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:29,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:29,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:29,208 INFO L427 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:29,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:29,208 INFO L82 PathProgramCache]: Analyzing trace with hash -800692070, now seen corresponding path program 496 times [2020-02-10 20:14:29,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:29,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320135617] [2020-02-10 20:14:29,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:29,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:14:29,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320135617] [2020-02-10 20:14:29,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:29,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:29,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562205540] [2020-02-10 20:14:29,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:29,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:29,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:29,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:29,421 INFO L87 Difference]: Start difference. First operand 152 states and 416 transitions. Second operand 8 states. [2020-02-10 20:14:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:29,508 INFO L93 Difference]: Finished difference Result 250 states and 572 transitions. [2020-02-10 20:14:29,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:29,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:29,509 INFO L225 Difference]: With dead ends: 250 [2020-02-10 20:14:29,510 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 20:14:29,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:29,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 20:14:29,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 147. [2020-02-10 20:14:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:14:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 404 transitions. [2020-02-10 20:14:29,514 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 404 transitions. Word has length 19 [2020-02-10 20:14:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:29,514 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 404 transitions. [2020-02-10 20:14:29,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 404 transitions. [2020-02-10 20:14:29,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:29,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:29,515 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:29,515 INFO L427 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:29,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:29,515 INFO L82 PathProgramCache]: Analyzing trace with hash 350791652, now seen corresponding path program 497 times [2020-02-10 20:14:29,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:29,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722014700] [2020-02-10 20:14:29,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:29,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722014700] [2020-02-10 20:14:29,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:29,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:29,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425939273] [2020-02-10 20:14:29,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:29,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:29,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:29,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:29,726 INFO L87 Difference]: Start difference. First operand 147 states and 404 transitions. Second operand 8 states. [2020-02-10 20:14:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:29,796 INFO L93 Difference]: Finished difference Result 239 states and 548 transitions. [2020-02-10 20:14:29,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:29,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:29,797 INFO L225 Difference]: With dead ends: 239 [2020-02-10 20:14:29,797 INFO L226 Difference]: Without dead ends: 229 [2020-02-10 20:14:29,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-02-10 20:14:29,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 149. [2020-02-10 20:14:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:14:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 407 transitions. [2020-02-10 20:14:29,801 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 407 transitions. Word has length 19 [2020-02-10 20:14:29,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:29,801 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 407 transitions. [2020-02-10 20:14:29,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:29,801 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 407 transitions. [2020-02-10 20:14:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:29,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:29,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:29,802 INFO L427 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:29,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:29,802 INFO L82 PathProgramCache]: Analyzing trace with hash -504515002, now seen corresponding path program 498 times [2020-02-10 20:14:29,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:29,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448716282] [2020-02-10 20:14:29,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:30,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448716282] [2020-02-10 20:14:30,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:30,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:30,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714755774] [2020-02-10 20:14:30,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:30,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:30,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:30,018 INFO L87 Difference]: Start difference. First operand 149 states and 407 transitions. Second operand 8 states. [2020-02-10 20:14:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:30,096 INFO L93 Difference]: Finished difference Result 241 states and 551 transitions. [2020-02-10 20:14:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:30,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:30,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:30,097 INFO L225 Difference]: With dead ends: 241 [2020-02-10 20:14:30,097 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 20:14:30,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 20:14:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2020-02-10 20:14:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-02-10 20:14:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 398 transitions. [2020-02-10 20:14:30,101 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 398 transitions. Word has length 19 [2020-02-10 20:14:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:30,101 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 398 transitions. [2020-02-10 20:14:30,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 398 transitions. [2020-02-10 20:14:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:30,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:30,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:30,102 INFO L427 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:30,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:30,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1269308130, now seen corresponding path program 499 times [2020-02-10 20:14:30,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:30,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898688303] [2020-02-10 20:14:30,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:30,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898688303] [2020-02-10 20:14:30,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:30,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:30,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608067396] [2020-02-10 20:14:30,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:30,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:30,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:30,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:30,320 INFO L87 Difference]: Start difference. First operand 144 states and 398 transitions. Second operand 8 states. [2020-02-10 20:14:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:30,408 INFO L93 Difference]: Finished difference Result 223 states and 511 transitions. [2020-02-10 20:14:30,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:30,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:30,409 INFO L225 Difference]: With dead ends: 223 [2020-02-10 20:14:30,409 INFO L226 Difference]: Without dead ends: 213 [2020-02-10 20:14:30,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-02-10 20:14:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 146. [2020-02-10 20:14:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 20:14:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 402 transitions. [2020-02-10 20:14:30,413 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 402 transitions. Word has length 19 [2020-02-10 20:14:30,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:30,413 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 402 transitions. [2020-02-10 20:14:30,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 402 transitions. [2020-02-10 20:14:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:30,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:30,413 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:30,413 INFO L427 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:30,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:30,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1508950468, now seen corresponding path program 500 times [2020-02-10 20:14:30,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:30,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830319910] [2020-02-10 20:14:30,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:30,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830319910] [2020-02-10 20:14:30,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:30,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:30,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222848604] [2020-02-10 20:14:30,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:30,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:30,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:30,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:30,629 INFO L87 Difference]: Start difference. First operand 146 states and 402 transitions. Second operand 8 states. [2020-02-10 20:14:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:30,700 INFO L93 Difference]: Finished difference Result 223 states and 510 transitions. [2020-02-10 20:14:30,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:30,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:30,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:30,701 INFO L225 Difference]: With dead ends: 223 [2020-02-10 20:14:30,701 INFO L226 Difference]: Without dead ends: 212 [2020-02-10 20:14:30,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:30,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-02-10 20:14:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 145. [2020-02-10 20:14:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 20:14:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 400 transitions. [2020-02-10 20:14:30,705 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 400 transitions. Word has length 19 [2020-02-10 20:14:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:30,705 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 400 transitions. [2020-02-10 20:14:30,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 400 transitions. [2020-02-10 20:14:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:30,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:30,705 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:30,705 INFO L427 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:30,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2014010628, now seen corresponding path program 501 times [2020-02-10 20:14:30,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:30,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179371153] [2020-02-10 20:14:30,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:30,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179371153] [2020-02-10 20:14:30,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:30,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:30,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753155133] [2020-02-10 20:14:30,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:30,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:30,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:30,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:30,924 INFO L87 Difference]: Start difference. First operand 145 states and 400 transitions. Second operand 8 states. [2020-02-10 20:14:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:31,009 INFO L93 Difference]: Finished difference Result 226 states and 518 transitions. [2020-02-10 20:14:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:31,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:31,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:31,011 INFO L225 Difference]: With dead ends: 226 [2020-02-10 20:14:31,011 INFO L226 Difference]: Without dead ends: 216 [2020-02-10 20:14:31,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-02-10 20:14:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 147. [2020-02-10 20:14:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:14:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 403 transitions. [2020-02-10 20:14:31,015 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 403 transitions. Word has length 19 [2020-02-10 20:14:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:31,015 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 403 transitions. [2020-02-10 20:14:31,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 403 transitions. [2020-02-10 20:14:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:31,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:31,016 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:31,016 INFO L427 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:31,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:31,016 INFO L82 PathProgramCache]: Analyzing trace with hash -303397320, now seen corresponding path program 502 times [2020-02-10 20:14:31,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:31,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470281939] [2020-02-10 20:14:31,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:31,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470281939] [2020-02-10 20:14:31,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:31,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:31,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407818416] [2020-02-10 20:14:31,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:31,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:31,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:31,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:31,235 INFO L87 Difference]: Start difference. First operand 147 states and 403 transitions. Second operand 8 states. [2020-02-10 20:14:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:31,323 INFO L93 Difference]: Finished difference Result 228 states and 521 transitions. [2020-02-10 20:14:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:31,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:31,324 INFO L225 Difference]: With dead ends: 228 [2020-02-10 20:14:31,325 INFO L226 Difference]: Without dead ends: 214 [2020-02-10 20:14:31,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-02-10 20:14:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 145. [2020-02-10 20:14:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 20:14:31,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 399 transitions. [2020-02-10 20:14:31,329 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 399 transitions. Word has length 19 [2020-02-10 20:14:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:31,329 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 399 transitions. [2020-02-10 20:14:31,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 399 transitions. [2020-02-10 20:14:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:31,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:31,329 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:31,330 INFO L427 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:31,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1712931448, now seen corresponding path program 503 times [2020-02-10 20:14:31,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:31,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699814027] [2020-02-10 20:14:31,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:31,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699814027] [2020-02-10 20:14:31,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:31,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:31,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827450408] [2020-02-10 20:14:31,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:31,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:31,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:31,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:31,545 INFO L87 Difference]: Start difference. First operand 145 states and 399 transitions. Second operand 8 states. [2020-02-10 20:14:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:31,614 INFO L93 Difference]: Finished difference Result 226 states and 517 transitions. [2020-02-10 20:14:31,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:31,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:31,615 INFO L225 Difference]: With dead ends: 226 [2020-02-10 20:14:31,615 INFO L226 Difference]: Without dead ends: 216 [2020-02-10 20:14:31,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-02-10 20:14:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 147. [2020-02-10 20:14:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:14:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 402 transitions. [2020-02-10 20:14:31,618 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 402 transitions. Word has length 19 [2020-02-10 20:14:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:31,619 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 402 transitions. [2020-02-10 20:14:31,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 402 transitions. [2020-02-10 20:14:31,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:31,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:31,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:31,619 INFO L427 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:31,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:31,619 INFO L82 PathProgramCache]: Analyzing trace with hash 857624794, now seen corresponding path program 504 times [2020-02-10 20:14:31,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:31,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68854228] [2020-02-10 20:14:31,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:31,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68854228] [2020-02-10 20:14:31,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:31,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:31,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498250143] [2020-02-10 20:14:31,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:31,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:31,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:31,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:31,846 INFO L87 Difference]: Start difference. First operand 147 states and 402 transitions. Second operand 8 states. [2020-02-10 20:14:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:31,936 INFO L93 Difference]: Finished difference Result 228 states and 520 transitions. [2020-02-10 20:14:31,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:31,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:31,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:31,937 INFO L225 Difference]: With dead ends: 228 [2020-02-10 20:14:31,937 INFO L226 Difference]: Without dead ends: 211 [2020-02-10 20:14:31,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-02-10 20:14:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 142. [2020-02-10 20:14:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-02-10 20:14:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 394 transitions. [2020-02-10 20:14:31,941 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 394 transitions. Word has length 19 [2020-02-10 20:14:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:31,941 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 394 transitions. [2020-02-10 20:14:31,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 394 transitions. [2020-02-10 20:14:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:31,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:31,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:31,941 INFO L427 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:31,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:31,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1123308150, now seen corresponding path program 505 times [2020-02-10 20:14:31,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:31,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696751631] [2020-02-10 20:14:31,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:32,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:32,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696751631] [2020-02-10 20:14:32,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:32,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:32,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500239196] [2020-02-10 20:14:32,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:32,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:32,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:32,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:32,130 INFO L87 Difference]: Start difference. First operand 142 states and 394 transitions. Second operand 8 states. [2020-02-10 20:14:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:32,194 INFO L93 Difference]: Finished difference Result 241 states and 546 transitions. [2020-02-10 20:14:32,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:32,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:32,195 INFO L225 Difference]: With dead ends: 241 [2020-02-10 20:14:32,195 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:14:32,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:14:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 145. [2020-02-10 20:14:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 20:14:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 398 transitions. [2020-02-10 20:14:32,199 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 398 transitions. Word has length 19 [2020-02-10 20:14:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:32,199 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 398 transitions. [2020-02-10 20:14:32,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 398 transitions. [2020-02-10 20:14:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:32,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:32,199 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:32,199 INFO L427 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:32,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1019932600, now seen corresponding path program 506 times [2020-02-10 20:14:32,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:32,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521132227] [2020-02-10 20:14:32,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:32,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521132227] [2020-02-10 20:14:32,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:32,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:32,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861405325] [2020-02-10 20:14:32,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:32,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:32,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:32,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:32,388 INFO L87 Difference]: Start difference. First operand 145 states and 398 transitions. Second operand 8 states. [2020-02-10 20:14:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:32,466 INFO L93 Difference]: Finished difference Result 235 states and 531 transitions. [2020-02-10 20:14:32,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:32,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:32,467 INFO L225 Difference]: With dead ends: 235 [2020-02-10 20:14:32,468 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 20:14:32,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 20:14:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 142. [2020-02-10 20:14:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-02-10 20:14:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 392 transitions. [2020-02-10 20:14:32,471 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 392 transitions. Word has length 19 [2020-02-10 20:14:32,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:32,471 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 392 transitions. [2020-02-10 20:14:32,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:32,471 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 392 transitions. [2020-02-10 20:14:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:32,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:32,472 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:32,472 INFO L427 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:32,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:32,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1571221292, now seen corresponding path program 507 times [2020-02-10 20:14:32,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:32,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275510597] [2020-02-10 20:14:32,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:32,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275510597] [2020-02-10 20:14:32,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:32,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:32,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165612108] [2020-02-10 20:14:32,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:32,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:32,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:32,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:32,672 INFO L87 Difference]: Start difference. First operand 142 states and 392 transitions. Second operand 8 states. [2020-02-10 20:14:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:32,729 INFO L93 Difference]: Finished difference Result 241 states and 544 transitions. [2020-02-10 20:14:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:32,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:32,730 INFO L225 Difference]: With dead ends: 241 [2020-02-10 20:14:32,730 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:14:32,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:14:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 145. [2020-02-10 20:14:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 20:14:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 396 transitions. [2020-02-10 20:14:32,734 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 396 transitions. Word has length 19 [2020-02-10 20:14:32,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:32,734 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 396 transitions. [2020-02-10 20:14:32,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 396 transitions. [2020-02-10 20:14:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:32,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:32,735 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:32,735 INFO L427 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:32,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:32,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1830279518, now seen corresponding path program 508 times [2020-02-10 20:14:32,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:32,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331644242] [2020-02-10 20:14:32,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:32,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331644242] [2020-02-10 20:14:32,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:32,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:32,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612559236] [2020-02-10 20:14:32,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:32,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:32,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:32,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:32,951 INFO L87 Difference]: Start difference. First operand 145 states and 396 transitions. Second operand 8 states. [2020-02-10 20:14:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:33,030 INFO L93 Difference]: Finished difference Result 235 states and 529 transitions. [2020-02-10 20:14:33,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:33,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:33,031 INFO L225 Difference]: With dead ends: 235 [2020-02-10 20:14:33,031 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 20:14:33,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 20:14:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 142. [2020-02-10 20:14:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-02-10 20:14:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 390 transitions. [2020-02-10 20:14:33,036 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 390 transitions. Word has length 19 [2020-02-10 20:14:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:33,036 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 390 transitions. [2020-02-10 20:14:33,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 390 transitions. [2020-02-10 20:14:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:33,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:33,037 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:33,037 INFO L427 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:33,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:33,037 INFO L82 PathProgramCache]: Analyzing trace with hash 589841196, now seen corresponding path program 509 times [2020-02-10 20:14:33,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:33,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125286854] [2020-02-10 20:14:33,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:33,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:14:33,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125286854] [2020-02-10 20:14:33,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:33,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:33,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325738203] [2020-02-10 20:14:33,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:33,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:33,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:33,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:33,233 INFO L87 Difference]: Start difference. First operand 142 states and 390 transitions. Second operand 8 states. [2020-02-10 20:14:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:33,322 INFO L93 Difference]: Finished difference Result 227 states and 513 transitions. [2020-02-10 20:14:33,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:33,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:33,323 INFO L225 Difference]: With dead ends: 227 [2020-02-10 20:14:33,323 INFO L226 Difference]: Without dead ends: 217 [2020-02-10 20:14:33,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-02-10 20:14:33,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 143. [2020-02-10 20:14:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:14:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 391 transitions. [2020-02-10 20:14:33,328 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 391 transitions. Word has length 19 [2020-02-10 20:14:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:33,328 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 391 transitions. [2020-02-10 20:14:33,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 391 transitions. [2020-02-10 20:14:33,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:33,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:33,328 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:33,328 INFO L427 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:33,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:33,329 INFO L82 PathProgramCache]: Analyzing trace with hash 350198858, now seen corresponding path program 510 times [2020-02-10 20:14:33,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:33,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025555865] [2020-02-10 20:14:33,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:33,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025555865] [2020-02-10 20:14:33,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:33,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:33,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042635422] [2020-02-10 20:14:33,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:33,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:33,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:33,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:33,527 INFO L87 Difference]: Start difference. First operand 143 states and 391 transitions. Second operand 8 states. [2020-02-10 20:14:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:33,593 INFO L93 Difference]: Finished difference Result 227 states and 512 transitions. [2020-02-10 20:14:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:33,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:33,595 INFO L225 Difference]: With dead ends: 227 [2020-02-10 20:14:33,595 INFO L226 Difference]: Without dead ends: 214 [2020-02-10 20:14:33,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-02-10 20:14:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 140. [2020-02-10 20:14:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 20:14:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 386 transitions. [2020-02-10 20:14:33,599 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 386 transitions. Word has length 19 [2020-02-10 20:14:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:33,599 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 386 transitions. [2020-02-10 20:14:33,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 386 transitions. [2020-02-10 20:14:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:33,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:33,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:33,600 INFO L427 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:33,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:33,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1566207290, now seen corresponding path program 511 times [2020-02-10 20:14:33,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:33,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944028516] [2020-02-10 20:14:33,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:33,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:14:33,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944028516] [2020-02-10 20:14:33,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:33,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:33,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117849235] [2020-02-10 20:14:33,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:33,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:33,783 INFO L87 Difference]: Start difference. First operand 140 states and 386 transitions. Second operand 8 states. [2020-02-10 20:14:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:33,849 INFO L93 Difference]: Finished difference Result 246 states and 561 transitions. [2020-02-10 20:14:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:33,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:33,850 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:14:33,850 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 20:14:33,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 20:14:33,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 146. [2020-02-10 20:14:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 20:14:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 400 transitions. [2020-02-10 20:14:33,854 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 400 transitions. Word has length 19 [2020-02-10 20:14:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:33,854 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 400 transitions. [2020-02-10 20:14:33,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 400 transitions. [2020-02-10 20:14:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:33,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:33,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:33,855 INFO L427 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:33,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:33,855 INFO L82 PathProgramCache]: Analyzing trace with hash 577033460, now seen corresponding path program 512 times [2020-02-10 20:14:33,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:33,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977304479] [2020-02-10 20:14:33,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:34,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977304479] [2020-02-10 20:14:34,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:34,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:34,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843039664] [2020-02-10 20:14:34,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:34,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:34,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:34,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:34,033 INFO L87 Difference]: Start difference. First operand 146 states and 400 transitions. Second operand 8 states. [2020-02-10 20:14:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:34,116 INFO L93 Difference]: Finished difference Result 240 states and 546 transitions. [2020-02-10 20:14:34,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:34,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:34,117 INFO L225 Difference]: With dead ends: 240 [2020-02-10 20:14:34,118 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 20:14:34,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 20:14:34,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2020-02-10 20:14:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:14:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 393 transitions. [2020-02-10 20:14:34,121 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 393 transitions. Word has length 19 [2020-02-10 20:14:34,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:34,121 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 393 transitions. [2020-02-10 20:14:34,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 393 transitions. [2020-02-10 20:14:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:34,122 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:34,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:34,122 INFO L427 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:34,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2072553556, now seen corresponding path program 513 times [2020-02-10 20:14:34,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:34,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416635053] [2020-02-10 20:14:34,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:34,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416635053] [2020-02-10 20:14:34,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:34,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:34,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955401111] [2020-02-10 20:14:34,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:34,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:34,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:34,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:34,302 INFO L87 Difference]: Start difference. First operand 143 states and 393 transitions. Second operand 8 states. [2020-02-10 20:14:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:34,368 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-02-10 20:14:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:34,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:34,369 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:14:34,369 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:14:34,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:14:34,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-02-10 20:14:34,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:14:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 404 transitions. [2020-02-10 20:14:34,373 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 404 transitions. Word has length 19 [2020-02-10 20:14:34,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:34,373 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 404 transitions. [2020-02-10 20:14:34,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 404 transitions. [2020-02-10 20:14:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:34,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:34,374 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:34,374 INFO L427 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:34,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:34,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1246208990, now seen corresponding path program 514 times [2020-02-10 20:14:34,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:34,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851394272] [2020-02-10 20:14:34,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:34,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851394272] [2020-02-10 20:14:34,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:34,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:34,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283716140] [2020-02-10 20:14:34,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:34,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:34,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:34,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:34,554 INFO L87 Difference]: Start difference. First operand 149 states and 404 transitions. Second operand 8 states. [2020-02-10 20:14:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:34,638 INFO L93 Difference]: Finished difference Result 232 states and 540 transitions. [2020-02-10 20:14:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:34,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:34,639 INFO L225 Difference]: With dead ends: 232 [2020-02-10 20:14:34,639 INFO L226 Difference]: Without dead ends: 213 [2020-02-10 20:14:34,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:34,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-02-10 20:14:34,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2020-02-10 20:14:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:14:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 390 transitions. [2020-02-10 20:14:34,643 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 390 transitions. Word has length 19 [2020-02-10 20:14:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:34,643 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 390 transitions. [2020-02-10 20:14:34,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 390 transitions. [2020-02-10 20:14:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:34,643 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:34,643 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:34,644 INFO L427 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash 692674962, now seen corresponding path program 515 times [2020-02-10 20:14:34,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:34,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960153107] [2020-02-10 20:14:34,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:34,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960153107] [2020-02-10 20:14:34,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:34,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:34,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368996986] [2020-02-10 20:14:34,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:34,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:34,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:34,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:34,822 INFO L87 Difference]: Start difference. First operand 143 states and 390 transitions. Second operand 8 states. [2020-02-10 20:14:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:34,905 INFO L93 Difference]: Finished difference Result 234 states and 533 transitions. [2020-02-10 20:14:34,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:34,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:34,906 INFO L225 Difference]: With dead ends: 234 [2020-02-10 20:14:34,906 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 20:14:34,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 20:14:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 145. [2020-02-10 20:14:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 20:14:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 393 transitions. [2020-02-10 20:14:34,910 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 393 transitions. Word has length 19 [2020-02-10 20:14:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:34,910 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 393 transitions. [2020-02-10 20:14:34,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 393 transitions. [2020-02-10 20:14:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:34,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:34,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:34,911 INFO L427 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:34,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1036372372, now seen corresponding path program 516 times [2020-02-10 20:14:34,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:34,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435563097] [2020-02-10 20:14:34,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:35,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:14:35,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435563097] [2020-02-10 20:14:35,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:35,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:35,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288934684] [2020-02-10 20:14:35,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:35,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:35,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:35,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:35,081 INFO L87 Difference]: Start difference. First operand 145 states and 393 transitions. Second operand 8 states. [2020-02-10 20:14:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:35,165 INFO L93 Difference]: Finished difference Result 228 states and 529 transitions. [2020-02-10 20:14:35,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:35,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:35,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:35,166 INFO L225 Difference]: With dead ends: 228 [2020-02-10 20:14:35,166 INFO L226 Difference]: Without dead ends: 210 [2020-02-10 20:14:35,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-02-10 20:14:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 140. [2020-02-10 20:14:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 20:14:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 384 transitions. [2020-02-10 20:14:35,170 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 384 transitions. Word has length 19 [2020-02-10 20:14:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:35,170 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 384 transitions. [2020-02-10 20:14:35,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 384 transitions. [2020-02-10 20:14:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:35,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:35,171 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:35,171 INFO L427 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:35,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1240611066, now seen corresponding path program 517 times [2020-02-10 20:14:35,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:35,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543698811] [2020-02-10 20:14:35,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:35,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543698811] [2020-02-10 20:14:35,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:35,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:35,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547649496] [2020-02-10 20:14:35,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:35,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:35,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:35,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:35,362 INFO L87 Difference]: Start difference. First operand 140 states and 384 transitions. Second operand 8 states. [2020-02-10 20:14:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:35,424 INFO L93 Difference]: Finished difference Result 246 states and 559 transitions. [2020-02-10 20:14:35,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:35,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:35,425 INFO L225 Difference]: With dead ends: 246 [2020-02-10 20:14:35,425 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 20:14:35,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 20:14:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 146. [2020-02-10 20:14:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 20:14:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 398 transitions. [2020-02-10 20:14:35,430 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 398 transitions. Word has length 19 [2020-02-10 20:14:35,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:35,430 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 398 transitions. [2020-02-10 20:14:35,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 398 transitions. [2020-02-10 20:14:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:35,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:35,430 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:35,430 INFO L427 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:35,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:35,431 INFO L82 PathProgramCache]: Analyzing trace with hash -981552840, now seen corresponding path program 518 times [2020-02-10 20:14:35,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:35,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539266228] [2020-02-10 20:14:35,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:35,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:14:35,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539266228] [2020-02-10 20:14:35,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:35,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:35,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236812018] [2020-02-10 20:14:35,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:35,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:35,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:35,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:35,658 INFO L87 Difference]: Start difference. First operand 146 states and 398 transitions. Second operand 8 states. [2020-02-10 20:14:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:35,721 INFO L93 Difference]: Finished difference Result 240 states and 544 transitions. [2020-02-10 20:14:35,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:35,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:35,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:35,722 INFO L225 Difference]: With dead ends: 240 [2020-02-10 20:14:35,722 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 20:14:35,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:35,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 20:14:35,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2020-02-10 20:14:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:14:35,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 391 transitions. [2020-02-10 20:14:35,726 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 391 transitions. Word has length 19 [2020-02-10 20:14:35,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:35,727 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 391 transitions. [2020-02-10 20:14:35,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 391 transitions. [2020-02-10 20:14:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:35,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:35,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:35,727 INFO L427 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:35,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash -146519478, now seen corresponding path program 519 times [2020-02-10 20:14:35,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:35,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482057000] [2020-02-10 20:14:35,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:35,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482057000] [2020-02-10 20:14:35,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:35,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:35,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108569768] [2020-02-10 20:14:35,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:35,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:35,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:35,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:35,937 INFO L87 Difference]: Start difference. First operand 143 states and 391 transitions. Second operand 8 states. [2020-02-10 20:14:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:36,012 INFO L93 Difference]: Finished difference Result 244 states and 558 transitions. [2020-02-10 20:14:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:36,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:36,013 INFO L225 Difference]: With dead ends: 244 [2020-02-10 20:14:36,013 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:14:36,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:14:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-02-10 20:14:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 20:14:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 402 transitions. [2020-02-10 20:14:36,017 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 402 transitions. Word has length 19 [2020-02-10 20:14:36,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:36,017 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 402 transitions. [2020-02-10 20:14:36,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 402 transitions. [2020-02-10 20:14:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:36,018 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:36,018 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:36,018 INFO L427 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:36,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:36,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1122724228, now seen corresponding path program 520 times [2020-02-10 20:14:36,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:36,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103354935] [2020-02-10 20:14:36,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:36,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103354935] [2020-02-10 20:14:36,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:36,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:36,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396189508] [2020-02-10 20:14:36,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:36,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:36,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:36,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:36,208 INFO L87 Difference]: Start difference. First operand 149 states and 402 transitions. Second operand 8 states. [2020-02-10 20:14:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:36,290 INFO L93 Difference]: Finished difference Result 232 states and 538 transitions. [2020-02-10 20:14:36,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:36,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:36,291 INFO L225 Difference]: With dead ends: 232 [2020-02-10 20:14:36,291 INFO L226 Difference]: Without dead ends: 213 [2020-02-10 20:14:36,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-02-10 20:14:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2020-02-10 20:14:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:14:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 388 transitions. [2020-02-10 20:14:36,295 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 388 transitions. Word has length 19 [2020-02-10 20:14:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:36,295 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 388 transitions. [2020-02-10 20:14:36,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 388 transitions. [2020-02-10 20:14:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:36,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:36,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:36,295 INFO L427 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:36,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:36,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1864843108, now seen corresponding path program 521 times [2020-02-10 20:14:36,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:36,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003665076] [2020-02-10 20:14:36,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:36,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003665076] [2020-02-10 20:14:36,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:36,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:36,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11144591] [2020-02-10 20:14:36,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:36,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:36,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:36,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:36,491 INFO L87 Difference]: Start difference. First operand 143 states and 388 transitions. Second operand 8 states. [2020-02-10 20:14:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:36,556 INFO L93 Difference]: Finished difference Result 234 states and 531 transitions. [2020-02-10 20:14:36,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:36,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:36,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:36,557 INFO L225 Difference]: With dead ends: 234 [2020-02-10 20:14:36,557 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 20:14:36,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 20:14:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 145. [2020-02-10 20:14:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 20:14:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 391 transitions. [2020-02-10 20:14:36,560 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 391 transitions. Word has length 19 [2020-02-10 20:14:36,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:36,560 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 391 transitions. [2020-02-10 20:14:36,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 391 transitions. [2020-02-10 20:14:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:36,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:36,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:36,561 INFO L427 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:36,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:36,561 INFO L82 PathProgramCache]: Analyzing trace with hash -940719192, now seen corresponding path program 522 times [2020-02-10 20:14:36,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:36,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381948905] [2020-02-10 20:14:36,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:36,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381948905] [2020-02-10 20:14:36,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:36,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:36,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919891650] [2020-02-10 20:14:36,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:36,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:36,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:36,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:36,743 INFO L87 Difference]: Start difference. First operand 145 states and 391 transitions. Second operand 8 states. [2020-02-10 20:14:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:36,831 INFO L93 Difference]: Finished difference Result 228 states and 527 transitions. [2020-02-10 20:14:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:36,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:36,832 INFO L225 Difference]: With dead ends: 228 [2020-02-10 20:14:36,832 INFO L226 Difference]: Without dead ends: 210 [2020-02-10 20:14:36,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-02-10 20:14:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 140. [2020-02-10 20:14:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 20:14:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 382 transitions. [2020-02-10 20:14:36,836 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 382 transitions. Word has length 19 [2020-02-10 20:14:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:36,836 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 382 transitions. [2020-02-10 20:14:36,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 382 transitions. [2020-02-10 20:14:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:36,836 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:36,836 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:36,837 INFO L427 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:36,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:36,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1366197632, now seen corresponding path program 523 times [2020-02-10 20:14:36,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:36,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885333600] [2020-02-10 20:14:36,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:37,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885333600] [2020-02-10 20:14:37,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:37,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:37,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97681792] [2020-02-10 20:14:37,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:37,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:37,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:37,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:37,034 INFO L87 Difference]: Start difference. First operand 140 states and 382 transitions. Second operand 8 states. [2020-02-10 20:14:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:37,127 INFO L93 Difference]: Finished difference Result 220 states and 497 transitions. [2020-02-10 20:14:37,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:37,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:37,127 INFO L225 Difference]: With dead ends: 220 [2020-02-10 20:14:37,127 INFO L226 Difference]: Without dead ends: 210 [2020-02-10 20:14:37,127 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-02-10 20:14:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 142. [2020-02-10 20:14:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-02-10 20:14:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 386 transitions. [2020-02-10 20:14:37,130 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 386 transitions. Word has length 19 [2020-02-10 20:14:37,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:37,131 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 386 transitions. [2020-02-10 20:14:37,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 386 transitions. [2020-02-10 20:14:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:37,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:37,131 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:37,131 INFO L427 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:37,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:37,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1605839970, now seen corresponding path program 524 times [2020-02-10 20:14:37,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:37,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015797435] [2020-02-10 20:14:37,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:37,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015797435] [2020-02-10 20:14:37,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:37,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:37,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545694434] [2020-02-10 20:14:37,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:37,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:37,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:37,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:37,353 INFO L87 Difference]: Start difference. First operand 142 states and 386 transitions. Second operand 8 states. [2020-02-10 20:14:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:37,411 INFO L93 Difference]: Finished difference Result 220 states and 496 transitions. [2020-02-10 20:14:37,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:37,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:37,412 INFO L225 Difference]: With dead ends: 220 [2020-02-10 20:14:37,412 INFO L226 Difference]: Without dead ends: 209 [2020-02-10 20:14:37,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:37,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-02-10 20:14:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 141. [2020-02-10 20:14:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-02-10 20:14:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 384 transitions. [2020-02-10 20:14:37,416 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 384 transitions. Word has length 19 [2020-02-10 20:14:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:37,416 INFO L479 AbstractCegarLoop]: Abstraction has 141 states and 384 transitions. [2020-02-10 20:14:37,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 384 transitions. [2020-02-10 20:14:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:37,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:37,417 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:37,417 INFO L427 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:37,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:37,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1855684284, now seen corresponding path program 525 times [2020-02-10 20:14:37,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:37,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773922594] [2020-02-10 20:14:37,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:37,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773922594] [2020-02-10 20:14:37,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:37,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:37,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264658006] [2020-02-10 20:14:37,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:37,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:37,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:37,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:37,590 INFO L87 Difference]: Start difference. First operand 141 states and 384 transitions. Second operand 8 states. [2020-02-10 20:14:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:37,666 INFO L93 Difference]: Finished difference Result 222 states and 503 transitions. [2020-02-10 20:14:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:37,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:37,667 INFO L225 Difference]: With dead ends: 222 [2020-02-10 20:14:37,667 INFO L226 Difference]: Without dead ends: 212 [2020-02-10 20:14:37,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-02-10 20:14:37,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2020-02-10 20:14:37,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:14:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 387 transitions. [2020-02-10 20:14:37,670 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 387 transitions. Word has length 19 [2020-02-10 20:14:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:37,670 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 387 transitions. [2020-02-10 20:14:37,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 387 transitions. [2020-02-10 20:14:37,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:37,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:37,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:37,671 INFO L427 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:37,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:37,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1484304008, now seen corresponding path program 526 times [2020-02-10 20:14:37,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:37,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730138430] [2020-02-10 20:14:37,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:37,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730138430] [2020-02-10 20:14:37,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:37,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:37,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580695092] [2020-02-10 20:14:37,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:37,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:37,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:37,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:37,856 INFO L87 Difference]: Start difference. First operand 143 states and 387 transitions. Second operand 8 states. [2020-02-10 20:14:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:37,942 INFO L93 Difference]: Finished difference Result 216 states and 499 transitions. [2020-02-10 20:14:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:37,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:37,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:37,943 INFO L225 Difference]: With dead ends: 216 [2020-02-10 20:14:37,943 INFO L226 Difference]: Without dead ends: 201 [2020-02-10 20:14:37,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-02-10 20:14:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 141. [2020-02-10 20:14:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-02-10 20:14:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 383 transitions. [2020-02-10 20:14:37,950 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 383 transitions. Word has length 19 [2020-02-10 20:14:37,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:37,950 INFO L479 AbstractCegarLoop]: Abstraction has 141 states and 383 transitions. [2020-02-10 20:14:37,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 383 transitions. [2020-02-10 20:14:37,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:37,951 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:37,951 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:37,951 INFO L427 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:37,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:37,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1067984392, now seen corresponding path program 527 times [2020-02-10 20:14:37,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:37,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019050623] [2020-02-10 20:14:37,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:38,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019050623] [2020-02-10 20:14:38,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:38,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:38,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294199160] [2020-02-10 20:14:38,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:38,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:38,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:38,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:38,144 INFO L87 Difference]: Start difference. First operand 141 states and 383 transitions. Second operand 8 states. [2020-02-10 20:14:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:38,209 INFO L93 Difference]: Finished difference Result 222 states and 502 transitions. [2020-02-10 20:14:38,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:38,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:38,210 INFO L225 Difference]: With dead ends: 222 [2020-02-10 20:14:38,210 INFO L226 Difference]: Without dead ends: 212 [2020-02-10 20:14:38,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:38,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-02-10 20:14:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2020-02-10 20:14:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:14:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 386 transitions. [2020-02-10 20:14:38,214 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 386 transitions. Word has length 19 [2020-02-10 20:14:38,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:38,214 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 386 transitions. [2020-02-10 20:14:38,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:38,214 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 386 transitions. [2020-02-10 20:14:38,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:38,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:38,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:38,215 INFO L427 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:38,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash 421420604, now seen corresponding path program 528 times [2020-02-10 20:14:38,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:38,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730066092] [2020-02-10 20:14:38,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:38,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730066092] [2020-02-10 20:14:38,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:38,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:38,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762668998] [2020-02-10 20:14:38,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:38,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:38,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:38,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:38,401 INFO L87 Difference]: Start difference. First operand 143 states and 386 transitions. Second operand 8 states. [2020-02-10 20:14:38,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:38,489 INFO L93 Difference]: Finished difference Result 216 states and 498 transitions. [2020-02-10 20:14:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:38,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:38,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:38,490 INFO L225 Difference]: With dead ends: 216 [2020-02-10 20:14:38,490 INFO L226 Difference]: Without dead ends: 198 [2020-02-10 20:14:38,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:38,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-02-10 20:14:38,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 138. [2020-02-10 20:14:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 20:14:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 378 transitions. [2020-02-10 20:14:38,494 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 378 transitions. Word has length 19 [2020-02-10 20:14:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:38,494 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 378 transitions. [2020-02-10 20:14:38,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 378 transitions. [2020-02-10 20:14:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:38,494 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:38,494 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:38,494 INFO L427 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:38,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:38,495 INFO L82 PathProgramCache]: Analyzing trace with hash 380240202, now seen corresponding path program 529 times [2020-02-10 20:14:38,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:38,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879343627] [2020-02-10 20:14:38,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:38,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879343627] [2020-02-10 20:14:38,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:38,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:38,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882281300] [2020-02-10 20:14:38,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:38,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:38,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:38,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:38,694 INFO L87 Difference]: Start difference. First operand 138 states and 378 transitions. Second operand 8 states. [2020-02-10 20:14:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:38,758 INFO L93 Difference]: Finished difference Result 245 states and 557 transitions. [2020-02-10 20:14:38,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:38,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:38,759 INFO L225 Difference]: With dead ends: 245 [2020-02-10 20:14:38,759 INFO L226 Difference]: Without dead ends: 229 [2020-02-10 20:14:38,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-02-10 20:14:38,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 141. [2020-02-10 20:14:38,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-02-10 20:14:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 382 transitions. [2020-02-10 20:14:38,763 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 382 transitions. Word has length 19 [2020-02-10 20:14:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:38,763 INFO L479 AbstractCegarLoop]: Abstraction has 141 states and 382 transitions. [2020-02-10 20:14:38,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 382 transitions. [2020-02-10 20:14:38,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:38,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:38,764 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:38,764 INFO L427 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:38,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:38,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1771486344, now seen corresponding path program 530 times [2020-02-10 20:14:38,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:38,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951112196] [2020-02-10 20:14:38,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:38,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951112196] [2020-02-10 20:14:38,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:38,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:38,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718330815] [2020-02-10 20:14:38,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:38,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:38,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:38,958 INFO L87 Difference]: Start difference. First operand 141 states and 382 transitions. Second operand 8 states. [2020-02-10 20:14:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:39,040 INFO L93 Difference]: Finished difference Result 239 states and 542 transitions. [2020-02-10 20:14:39,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:39,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:39,042 INFO L225 Difference]: With dead ends: 239 [2020-02-10 20:14:39,042 INFO L226 Difference]: Without dead ends: 226 [2020-02-10 20:14:39,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-02-10 20:14:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 138. [2020-02-10 20:14:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 20:14:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 375 transitions. [2020-02-10 20:14:39,045 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 375 transitions. Word has length 19 [2020-02-10 20:14:39,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:39,045 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 375 transitions. [2020-02-10 20:14:39,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 375 transitions. [2020-02-10 20:14:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:39,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:39,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:39,046 INFO L427 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:39,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:39,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1474331790, now seen corresponding path program 531 times [2020-02-10 20:14:39,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:39,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078837598] [2020-02-10 20:14:39,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:39,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078837598] [2020-02-10 20:14:39,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:39,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:39,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671565154] [2020-02-10 20:14:39,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:39,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:39,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:39,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:39,250 INFO L87 Difference]: Start difference. First operand 138 states and 375 transitions. Second operand 8 states. [2020-02-10 20:14:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:39,311 INFO L93 Difference]: Finished difference Result 249 states and 566 transitions. [2020-02-10 20:14:39,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:39,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:39,312 INFO L225 Difference]: With dead ends: 249 [2020-02-10 20:14:39,312 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 20:14:39,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:39,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 20:14:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 143. [2020-02-10 20:14:39,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 20:14:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 384 transitions. [2020-02-10 20:14:39,316 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 384 transitions. Word has length 19 [2020-02-10 20:14:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:39,316 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 384 transitions. [2020-02-10 20:14:39,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 384 transitions. [2020-02-10 20:14:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:39,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:39,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:39,316 INFO L427 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:39,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:39,316 INFO L82 PathProgramCache]: Analyzing trace with hash 723269696, now seen corresponding path program 532 times [2020-02-10 20:14:39,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:39,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278753123] [2020-02-10 20:14:39,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:39,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278753123] [2020-02-10 20:14:39,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:39,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:39,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618722968] [2020-02-10 20:14:39,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:39,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:39,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:39,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:39,512 INFO L87 Difference]: Start difference. First operand 143 states and 384 transitions. Second operand 8 states. [2020-02-10 20:14:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:39,599 INFO L93 Difference]: Finished difference Result 245 states and 554 transitions. [2020-02-10 20:14:39,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:39,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:39,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:39,600 INFO L225 Difference]: With dead ends: 245 [2020-02-10 20:14:39,601 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 20:14:39,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 20:14:39,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 138. [2020-02-10 20:14:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 20:14:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 372 transitions. [2020-02-10 20:14:39,605 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 372 transitions. Word has length 19 [2020-02-10 20:14:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:39,605 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 372 transitions. [2020-02-10 20:14:39,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 372 transitions. [2020-02-10 20:14:39,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:39,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:39,605 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:39,605 INFO L427 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:39,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:39,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1883916852, now seen corresponding path program 533 times [2020-02-10 20:14:39,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:39,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719823202] [2020-02-10 20:14:39,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:39,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719823202] [2020-02-10 20:14:39,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:39,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:39,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786106279] [2020-02-10 20:14:39,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:39,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:39,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:39,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:39,802 INFO L87 Difference]: Start difference. First operand 138 states and 372 transitions. Second operand 8 states. [2020-02-10 20:14:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:39,886 INFO L93 Difference]: Finished difference Result 234 states and 530 transitions. [2020-02-10 20:14:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:39,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:39,887 INFO L225 Difference]: With dead ends: 234 [2020-02-10 20:14:39,887 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 20:14:39,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 20:14:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 140. [2020-02-10 20:14:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 20:14:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 375 transitions. [2020-02-10 20:14:39,891 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 375 transitions. Word has length 19 [2020-02-10 20:14:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:39,891 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 375 transitions. [2020-02-10 20:14:39,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 375 transitions. [2020-02-10 20:14:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:39,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:39,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:39,892 INFO L427 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:39,892 INFO L82 PathProgramCache]: Analyzing trace with hash -700437136, now seen corresponding path program 534 times [2020-02-10 20:14:39,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:39,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847929183] [2020-02-10 20:14:39,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:40,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847929183] [2020-02-10 20:14:40,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:40,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:40,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324347255] [2020-02-10 20:14:40,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:40,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:40,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:40,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:40,089 INFO L87 Difference]: Start difference. First operand 140 states and 375 transitions. Second operand 8 states. [2020-02-10 20:14:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:40,174 INFO L93 Difference]: Finished difference Result 236 states and 533 transitions. [2020-02-10 20:14:40,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:40,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:40,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:40,175 INFO L225 Difference]: With dead ends: 236 [2020-02-10 20:14:40,175 INFO L226 Difference]: Without dead ends: 219 [2020-02-10 20:14:40,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-02-10 20:14:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 135. [2020-02-10 20:14:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-02-10 20:14:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 365 transitions. [2020-02-10 20:14:40,179 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 365 transitions. Word has length 19 [2020-02-10 20:14:40,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:40,179 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 365 transitions. [2020-02-10 20:14:40,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 365 transitions. [2020-02-10 20:14:40,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:40,180 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:40,180 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:40,180 INFO L427 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:40,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:40,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1988693016, now seen corresponding path program 535 times [2020-02-10 20:14:40,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:40,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7731930] [2020-02-10 20:14:40,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:40,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7731930] [2020-02-10 20:14:40,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:40,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:40,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60940130] [2020-02-10 20:14:40,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:40,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:40,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:40,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:40,356 INFO L87 Difference]: Start difference. First operand 135 states and 365 transitions. Second operand 8 states. [2020-02-10 20:14:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:40,420 INFO L93 Difference]: Finished difference Result 241 states and 542 transitions. [2020-02-10 20:14:40,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:40,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:40,421 INFO L225 Difference]: With dead ends: 241 [2020-02-10 20:14:40,421 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 20:14:40,421 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 20:14:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 135. [2020-02-10 20:14:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-02-10 20:14:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 362 transitions. [2020-02-10 20:14:40,424 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 362 transitions. Word has length 19 [2020-02-10 20:14:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:40,424 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 362 transitions. [2020-02-10 20:14:40,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 362 transitions. [2020-02-10 20:14:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:40,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:40,425 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:40,425 INFO L427 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:40,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:40,425 INFO L82 PathProgramCache]: Analyzing trace with hash 154547734, now seen corresponding path program 536 times [2020-02-10 20:14:40,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:40,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165789103] [2020-02-10 20:14:40,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:40,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165789103] [2020-02-10 20:14:40,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:40,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:40,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259618219] [2020-02-10 20:14:40,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:40,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:40,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:40,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:40,597 INFO L87 Difference]: Start difference. First operand 135 states and 362 transitions. Second operand 8 states. [2020-02-10 20:14:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:40,674 INFO L93 Difference]: Finished difference Result 235 states and 527 transitions. [2020-02-10 20:14:40,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:40,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:40,675 INFO L225 Difference]: With dead ends: 235 [2020-02-10 20:14:40,675 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 20:14:40,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 20:14:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 132. [2020-02-10 20:14:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-02-10 20:14:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 355 transitions. [2020-02-10 20:14:40,678 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 355 transitions. Word has length 19 [2020-02-10 20:14:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:40,679 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 355 transitions. [2020-02-10 20:14:40,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 355 transitions. [2020-02-10 20:14:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:40,679 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:40,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:40,679 INFO L427 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1799928014, now seen corresponding path program 537 times [2020-02-10 20:14:40,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:40,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061364801] [2020-02-10 20:14:40,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:40,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061364801] [2020-02-10 20:14:40,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:40,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:40,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065690678] [2020-02-10 20:14:40,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:40,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:40,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:40,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:40,864 INFO L87 Difference]: Start difference. First operand 132 states and 355 transitions. Second operand 8 states. [2020-02-10 20:14:40,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:40,928 INFO L93 Difference]: Finished difference Result 239 states and 541 transitions. [2020-02-10 20:14:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:40,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:40,929 INFO L225 Difference]: With dead ends: 239 [2020-02-10 20:14:40,929 INFO L226 Difference]: Without dead ends: 223 [2020-02-10 20:14:40,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-02-10 20:14:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 138. [2020-02-10 20:14:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 20:14:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 366 transitions. [2020-02-10 20:14:40,933 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 366 transitions. Word has length 19 [2020-02-10 20:14:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:40,933 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 366 transitions. [2020-02-10 20:14:40,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 366 transitions. [2020-02-10 20:14:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:40,933 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:40,934 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:40,934 INFO L427 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:40,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:40,934 INFO L82 PathProgramCache]: Analyzing trace with hash 823723264, now seen corresponding path program 538 times [2020-02-10 20:14:40,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:40,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620957979] [2020-02-10 20:14:40,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:41,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620957979] [2020-02-10 20:14:41,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:41,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:41,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981936591] [2020-02-10 20:14:41,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:41,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:41,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:41,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:41,119 INFO L87 Difference]: Start difference. First operand 138 states and 366 transitions. Second operand 8 states. [2020-02-10 20:14:41,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:41,204 INFO L93 Difference]: Finished difference Result 227 states and 521 transitions. [2020-02-10 20:14:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:41,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:41,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:41,205 INFO L225 Difference]: With dead ends: 227 [2020-02-10 20:14:41,205 INFO L226 Difference]: Without dead ends: 208 [2020-02-10 20:14:41,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-02-10 20:14:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 132. [2020-02-10 20:14:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-02-10 20:14:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 352 transitions. [2020-02-10 20:14:41,209 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 352 transitions. Word has length 19 [2020-02-10 20:14:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:41,209 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 352 transitions. [2020-02-10 20:14:41,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 352 transitions. [2020-02-10 20:14:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:41,209 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:41,209 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:41,209 INFO L427 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:41,210 INFO L82 PathProgramCache]: Analyzing trace with hash 270189236, now seen corresponding path program 539 times [2020-02-10 20:14:41,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:41,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121964583] [2020-02-10 20:14:41,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:41,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121964583] [2020-02-10 20:14:41,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:41,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:41,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621125582] [2020-02-10 20:14:41,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:41,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:41,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:41,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:41,386 INFO L87 Difference]: Start difference. First operand 132 states and 352 transitions. Second operand 8 states. [2020-02-10 20:14:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:41,463 INFO L93 Difference]: Finished difference Result 229 states and 514 transitions. [2020-02-10 20:14:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:41,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:41,464 INFO L225 Difference]: With dead ends: 229 [2020-02-10 20:14:41,464 INFO L226 Difference]: Without dead ends: 219 [2020-02-10 20:14:41,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-02-10 20:14:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 134. [2020-02-10 20:14:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-02-10 20:14:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2020-02-10 20:14:41,467 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 19 [2020-02-10 20:14:41,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:41,468 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2020-02-10 20:14:41,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2020-02-10 20:14:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:41,468 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:41,468 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:41,468 INFO L427 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:41,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1458858098, now seen corresponding path program 540 times [2020-02-10 20:14:41,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:41,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462073270] [2020-02-10 20:14:41,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:41,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:41,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462073270] [2020-02-10 20:14:41,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:41,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:41,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041952078] [2020-02-10 20:14:41,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:41,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:41,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:41,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:41,641 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 8 states. [2020-02-10 20:14:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:41,725 INFO L93 Difference]: Finished difference Result 223 states and 510 transitions. [2020-02-10 20:14:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:41,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:41,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:41,726 INFO L225 Difference]: With dead ends: 223 [2020-02-10 20:14:41,726 INFO L226 Difference]: Without dead ends: 205 [2020-02-10 20:14:41,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-02-10 20:14:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 129. [2020-02-10 20:14:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-02-10 20:14:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 345 transitions. [2020-02-10 20:14:41,729 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 345 transitions. Word has length 19 [2020-02-10 20:14:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:41,730 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 345 transitions. [2020-02-10 20:14:41,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 345 transitions. [2020-02-10 20:14:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:41,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:41,730 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:41,730 INFO L427 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1337500568, now seen corresponding path program 541 times [2020-02-10 20:14:41,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:41,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389486018] [2020-02-10 20:14:41,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:41,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:14:41,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389486018] [2020-02-10 20:14:41,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:41,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:41,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102377793] [2020-02-10 20:14:41,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:41,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:41,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:41,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:41,959 INFO L87 Difference]: Start difference. First operand 129 states and 345 transitions. Second operand 8 states. [2020-02-10 20:14:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:42,023 INFO L93 Difference]: Finished difference Result 243 states and 557 transitions. [2020-02-10 20:14:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:42,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:42,024 INFO L225 Difference]: With dead ends: 243 [2020-02-10 20:14:42,025 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 20:14:42,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 20:14:42,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 139. [2020-02-10 20:14:42,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-02-10 20:14:42,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 373 transitions. [2020-02-10 20:14:42,028 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 373 transitions. Word has length 19 [2020-02-10 20:14:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:42,028 INFO L479 AbstractCegarLoop]: Abstraction has 139 states and 373 transitions. [2020-02-10 20:14:42,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:42,028 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 373 transitions. [2020-02-10 20:14:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:42,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:42,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:42,029 INFO L427 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:42,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:42,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2088562662, now seen corresponding path program 542 times [2020-02-10 20:14:42,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:42,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458286491] [2020-02-10 20:14:42,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:42,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458286491] [2020-02-10 20:14:42,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:42,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:42,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087305554] [2020-02-10 20:14:42,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:42,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:42,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:42,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:42,223 INFO L87 Difference]: Start difference. First operand 139 states and 373 transitions. Second operand 8 states. [2020-02-10 20:14:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:42,306 INFO L93 Difference]: Finished difference Result 239 states and 545 transitions. [2020-02-10 20:14:42,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:42,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:42,307 INFO L225 Difference]: With dead ends: 239 [2020-02-10 20:14:42,307 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 20:14:42,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 20:14:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 134. [2020-02-10 20:14:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-02-10 20:14:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 359 transitions. [2020-02-10 20:14:42,311 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 359 transitions. Word has length 19 [2020-02-10 20:14:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:42,311 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 359 transitions. [2020-02-10 20:14:42,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 359 transitions. [2020-02-10 20:14:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:42,312 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:42,312 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:42,312 INFO L427 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:42,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1357028874, now seen corresponding path program 543 times [2020-02-10 20:14:42,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:42,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742875086] [2020-02-10 20:14:42,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:42,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742875086] [2020-02-10 20:14:42,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:42,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:42,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261902515] [2020-02-10 20:14:42,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:42,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:42,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:42,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:42,506 INFO L87 Difference]: Start difference. First operand 134 states and 359 transitions. Second operand 8 states. [2020-02-10 20:14:42,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:42,569 INFO L93 Difference]: Finished difference Result 231 states and 525 transitions. [2020-02-10 20:14:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:42,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:42,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:42,570 INFO L225 Difference]: With dead ends: 231 [2020-02-10 20:14:42,570 INFO L226 Difference]: Without dead ends: 215 [2020-02-10 20:14:42,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-02-10 20:14:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 140. [2020-02-10 20:14:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 20:14:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 370 transitions. [2020-02-10 20:14:42,574 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 370 transitions. Word has length 19 [2020-02-10 20:14:42,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:42,574 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 370 transitions. [2020-02-10 20:14:42,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 370 transitions. [2020-02-10 20:14:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:42,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:42,575 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:42,575 INFO L427 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:42,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:42,575 INFO L82 PathProgramCache]: Analyzing trace with hash 380824124, now seen corresponding path program 544 times [2020-02-10 20:14:42,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:42,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950567263] [2020-02-10 20:14:42,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:42,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950567263] [2020-02-10 20:14:42,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:42,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:42,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117118671] [2020-02-10 20:14:42,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:42,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:42,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:42,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:42,767 INFO L87 Difference]: Start difference. First operand 140 states and 370 transitions. Second operand 8 states. [2020-02-10 20:14:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:42,851 INFO L93 Difference]: Finished difference Result 219 states and 505 transitions. [2020-02-10 20:14:42,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:42,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:42,852 INFO L225 Difference]: With dead ends: 219 [2020-02-10 20:14:42,852 INFO L226 Difference]: Without dead ends: 200 [2020-02-10 20:14:42,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-02-10 20:14:42,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 134. [2020-02-10 20:14:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-02-10 20:14:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 354 transitions. [2020-02-10 20:14:42,856 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 354 transitions. Word has length 19 [2020-02-10 20:14:42,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:42,856 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 354 transitions. [2020-02-10 20:14:42,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:42,856 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 354 transitions. [2020-02-10 20:14:42,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:42,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:42,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:42,856 INFO L427 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:42,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:42,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2008828456, now seen corresponding path program 545 times [2020-02-10 20:14:42,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:42,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939761693] [2020-02-10 20:14:42,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:43,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939761693] [2020-02-10 20:14:43,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:43,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:43,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67787718] [2020-02-10 20:14:43,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:43,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:43,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:43,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:43,050 INFO L87 Difference]: Start difference. First operand 134 states and 354 transitions. Second operand 8 states. [2020-02-10 20:14:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:43,136 INFO L93 Difference]: Finished difference Result 216 states and 499 transitions. [2020-02-10 20:14:43,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:43,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:43,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:43,137 INFO L225 Difference]: With dead ends: 216 [2020-02-10 20:14:43,138 INFO L226 Difference]: Without dead ends: 204 [2020-02-10 20:14:43,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-02-10 20:14:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 138. [2020-02-10 20:14:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 20:14:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 362 transitions. [2020-02-10 20:14:43,141 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 362 transitions. Word has length 19 [2020-02-10 20:14:43,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:43,142 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 362 transitions. [2020-02-10 20:14:43,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 362 transitions. [2020-02-10 20:14:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:43,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:43,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:43,142 INFO L427 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:43,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:43,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1427264310, now seen corresponding path program 546 times [2020-02-10 20:14:43,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:43,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360119825] [2020-02-10 20:14:43,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:43,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360119825] [2020-02-10 20:14:43,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:43,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:43,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507829664] [2020-02-10 20:14:43,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:43,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:43,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:43,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:43,331 INFO L87 Difference]: Start difference. First operand 138 states and 362 transitions. Second operand 8 states. [2020-02-10 20:14:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:43,414 INFO L93 Difference]: Finished difference Result 203 states and 478 transitions. [2020-02-10 20:14:43,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:43,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:43,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:43,415 INFO L225 Difference]: With dead ends: 203 [2020-02-10 20:14:43,415 INFO L226 Difference]: Without dead ends: 181 [2020-02-10 20:14:43,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:43,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-02-10 20:14:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 129. [2020-02-10 20:14:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-02-10 20:14:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 342 transitions. [2020-02-10 20:14:43,419 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 342 transitions. Word has length 19 [2020-02-10 20:14:43,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:43,419 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 342 transitions. [2020-02-10 20:14:43,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:43,419 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 342 transitions. [2020-02-10 20:14:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:43,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:43,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:43,419 INFO L427 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:43,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:43,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1173836118, now seen corresponding path program 547 times [2020-02-10 20:14:43,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:43,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665364206] [2020-02-10 20:14:43,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:43,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:14:43,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665364206] [2020-02-10 20:14:43,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:43,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:43,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053594647] [2020-02-10 20:14:43,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:43,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:43,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:43,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:43,617 INFO L87 Difference]: Start difference. First operand 129 states and 342 transitions. Second operand 8 states. [2020-02-10 20:14:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:43,703 INFO L93 Difference]: Finished difference Result 221 states and 497 transitions. [2020-02-10 20:14:43,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:43,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:43,704 INFO L225 Difference]: With dead ends: 221 [2020-02-10 20:14:43,704 INFO L226 Difference]: Without dead ends: 211 [2020-02-10 20:14:43,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-02-10 20:14:43,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 133. [2020-02-10 20:14:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-02-10 20:14:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 352 transitions. [2020-02-10 20:14:43,708 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 352 transitions. Word has length 19 [2020-02-10 20:14:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:43,708 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 352 transitions. [2020-02-10 20:14:43,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 352 transitions. [2020-02-10 20:14:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:43,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:43,709 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:43,709 INFO L427 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:43,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:43,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1410517870, now seen corresponding path program 548 times [2020-02-10 20:14:43,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:43,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420908308] [2020-02-10 20:14:43,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:43,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420908308] [2020-02-10 20:14:43,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:43,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:43,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372850558] [2020-02-10 20:14:43,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:43,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:43,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:43,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:43,901 INFO L87 Difference]: Start difference. First operand 133 states and 352 transitions. Second operand 8 states. [2020-02-10 20:14:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:43,988 INFO L93 Difference]: Finished difference Result 223 states and 500 transitions. [2020-02-10 20:14:43,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:43,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:43,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:43,989 INFO L225 Difference]: With dead ends: 223 [2020-02-10 20:14:43,989 INFO L226 Difference]: Without dead ends: 209 [2020-02-10 20:14:43,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-02-10 20:14:43,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 131. [2020-02-10 20:14:43,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-02-10 20:14:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 347 transitions. [2020-02-10 20:14:43,992 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 347 transitions. Word has length 19 [2020-02-10 20:14:43,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:43,992 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 347 transitions. [2020-02-10 20:14:43,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 347 transitions. [2020-02-10 20:14:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:43,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:43,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:43,993 INFO L427 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:43,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:43,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1918538616, now seen corresponding path program 549 times [2020-02-10 20:14:43,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:43,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096592118] [2020-02-10 20:14:43,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:44,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:14:44,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096592118] [2020-02-10 20:14:44,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:44,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:44,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024292079] [2020-02-10 20:14:44,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:44,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:44,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:44,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:44,178 INFO L87 Difference]: Start difference. First operand 131 states and 347 transitions. Second operand 8 states. [2020-02-10 20:14:44,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:44,264 INFO L93 Difference]: Finished difference Result 218 states and 489 transitions. [2020-02-10 20:14:44,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:44,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:44,265 INFO L225 Difference]: With dead ends: 218 [2020-02-10 20:14:44,265 INFO L226 Difference]: Without dead ends: 208 [2020-02-10 20:14:44,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-02-10 20:14:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 133. [2020-02-10 20:14:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-02-10 20:14:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 350 transitions. [2020-02-10 20:14:44,272 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 350 transitions. Word has length 19 [2020-02-10 20:14:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:44,273 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 350 transitions. [2020-02-10 20:14:44,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 350 transitions. [2020-02-10 20:14:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:44,273 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:44,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:44,273 INFO L427 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:44,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:44,273 INFO L82 PathProgramCache]: Analyzing trace with hash 189491282, now seen corresponding path program 550 times [2020-02-10 20:14:44,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:44,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74037295] [2020-02-10 20:14:44,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:44,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74037295] [2020-02-10 20:14:44,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:44,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:44,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874130381] [2020-02-10 20:14:44,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:44,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:44,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:44,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:44,457 INFO L87 Difference]: Start difference. First operand 133 states and 350 transitions. Second operand 8 states. [2020-02-10 20:14:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:44,540 INFO L93 Difference]: Finished difference Result 212 states and 485 transitions. [2020-02-10 20:14:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:44,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:44,541 INFO L225 Difference]: With dead ends: 212 [2020-02-10 20:14:44,541 INFO L226 Difference]: Without dead ends: 197 [2020-02-10 20:14:44,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-02-10 20:14:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2020-02-10 20:14:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-02-10 20:14:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 345 transitions. [2020-02-10 20:14:44,544 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 345 transitions. Word has length 19 [2020-02-10 20:14:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:44,545 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 345 transitions. [2020-02-10 20:14:44,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 345 transitions. [2020-02-10 20:14:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:44,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:44,545 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:44,545 INFO L427 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:44,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash 823589624, now seen corresponding path program 551 times [2020-02-10 20:14:44,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:44,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479427216] [2020-02-10 20:14:44,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:44,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479427216] [2020-02-10 20:14:44,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:44,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:44,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615679023] [2020-02-10 20:14:44,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:44,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:44,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:44,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:44,737 INFO L87 Difference]: Start difference. First operand 131 states and 345 transitions. Second operand 8 states. [2020-02-10 20:14:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:44,822 INFO L93 Difference]: Finished difference Result 213 states and 490 transitions. [2020-02-10 20:14:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:44,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:44,823 INFO L225 Difference]: With dead ends: 213 [2020-02-10 20:14:44,823 INFO L226 Difference]: Without dead ends: 201 [2020-02-10 20:14:44,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:44,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-02-10 20:14:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 135. [2020-02-10 20:14:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-02-10 20:14:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 353 transitions. [2020-02-10 20:14:44,827 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 353 transitions. Word has length 19 [2020-02-10 20:14:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:44,827 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 353 transitions. [2020-02-10 20:14:44,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 353 transitions. [2020-02-10 20:14:44,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:44,828 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:44,828 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:44,828 INFO L427 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:44,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:44,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1678896278, now seen corresponding path program 552 times [2020-02-10 20:14:44,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:44,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296375267] [2020-02-10 20:14:44,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:45,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296375267] [2020-02-10 20:14:45,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:45,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:45,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41489957] [2020-02-10 20:14:45,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:45,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:45,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:45,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:45,023 INFO L87 Difference]: Start difference. First operand 135 states and 353 transitions. Second operand 8 states. [2020-02-10 20:14:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:45,107 INFO L93 Difference]: Finished difference Result 200 states and 469 transitions. [2020-02-10 20:14:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:45,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:45,108 INFO L225 Difference]: With dead ends: 200 [2020-02-10 20:14:45,108 INFO L226 Difference]: Without dead ends: 178 [2020-02-10 20:14:45,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-02-10 20:14:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 126. [2020-02-10 20:14:45,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-02-10 20:14:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 336 transitions. [2020-02-10 20:14:45,112 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 336 transitions. Word has length 19 [2020-02-10 20:14:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:45,112 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 336 transitions. [2020-02-10 20:14:45,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 336 transitions. [2020-02-10 20:14:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:45,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:45,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:45,113 INFO L427 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:45,113 INFO L82 PathProgramCache]: Analyzing trace with hash 283350700, now seen corresponding path program 553 times [2020-02-10 20:14:45,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:45,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743753239] [2020-02-10 20:14:45,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:45,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743753239] [2020-02-10 20:14:45,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:45,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:45,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352857904] [2020-02-10 20:14:45,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:45,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:45,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:45,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:45,312 INFO L87 Difference]: Start difference. First operand 126 states and 336 transitions. Second operand 8 states. [2020-02-10 20:14:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:45,371 INFO L93 Difference]: Finished difference Result 220 states and 486 transitions. [2020-02-10 20:14:45,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:45,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:45,372 INFO L225 Difference]: With dead ends: 220 [2020-02-10 20:14:45,372 INFO L226 Difference]: Without dead ends: 204 [2020-02-10 20:14:45,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-02-10 20:14:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 129. [2020-02-10 20:14:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-02-10 20:14:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 340 transitions. [2020-02-10 20:14:45,375 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 340 transitions. Word has length 19 [2020-02-10 20:14:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:45,375 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 340 transitions. [2020-02-10 20:14:45,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 340 transitions. [2020-02-10 20:14:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:45,375 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:45,375 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:45,376 INFO L427 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:45,376 INFO L82 PathProgramCache]: Analyzing trace with hash 542408926, now seen corresponding path program 554 times [2020-02-10 20:14:45,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:45,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465683464] [2020-02-10 20:14:45,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:45,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465683464] [2020-02-10 20:14:45,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:45,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:45,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189287774] [2020-02-10 20:14:45,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:45,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:45,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:45,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:45,571 INFO L87 Difference]: Start difference. First operand 129 states and 340 transitions. Second operand 8 states. [2020-02-10 20:14:45,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:45,635 INFO L93 Difference]: Finished difference Result 214 states and 471 transitions. [2020-02-10 20:14:45,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:45,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:45,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:45,636 INFO L225 Difference]: With dead ends: 214 [2020-02-10 20:14:45,636 INFO L226 Difference]: Without dead ends: 201 [2020-02-10 20:14:45,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-02-10 20:14:45,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 126. [2020-02-10 20:14:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-02-10 20:14:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 333 transitions. [2020-02-10 20:14:45,639 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 333 transitions. Word has length 19 [2020-02-10 20:14:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:45,639 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 333 transitions. [2020-02-10 20:14:45,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 333 transitions. [2020-02-10 20:14:45,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:45,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:45,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:45,640 INFO L427 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:45,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:45,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1317087154, now seen corresponding path program 555 times [2020-02-10 20:14:45,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:45,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698714990] [2020-02-10 20:14:45,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:45,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698714990] [2020-02-10 20:14:45,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:45,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:45,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39132315] [2020-02-10 20:14:45,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:45,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:45,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:45,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:45,840 INFO L87 Difference]: Start difference. First operand 126 states and 333 transitions. Second operand 8 states. [2020-02-10 20:14:45,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:45,900 INFO L93 Difference]: Finished difference Result 224 states and 495 transitions. [2020-02-10 20:14:45,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:45,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:45,901 INFO L225 Difference]: With dead ends: 224 [2020-02-10 20:14:45,901 INFO L226 Difference]: Without dead ends: 208 [2020-02-10 20:14:45,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-02-10 20:14:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 131. [2020-02-10 20:14:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-02-10 20:14:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 342 transitions. [2020-02-10 20:14:45,904 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 342 transitions. Word has length 19 [2020-02-10 20:14:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:45,905 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 342 transitions. [2020-02-10 20:14:45,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 342 transitions. [2020-02-10 20:14:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:45,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:45,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:45,908 INFO L427 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2068149248, now seen corresponding path program 556 times [2020-02-10 20:14:45,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:45,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343232359] [2020-02-10 20:14:45,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:46,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:14:46,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343232359] [2020-02-10 20:14:46,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:46,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:46,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588145466] [2020-02-10 20:14:46,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:46,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:46,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:46,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:46,106 INFO L87 Difference]: Start difference. First operand 131 states and 342 transitions. Second operand 8 states. [2020-02-10 20:14:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:46,188 INFO L93 Difference]: Finished difference Result 220 states and 483 transitions. [2020-02-10 20:14:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:46,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:46,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:46,189 INFO L225 Difference]: With dead ends: 220 [2020-02-10 20:14:46,189 INFO L226 Difference]: Without dead ends: 203 [2020-02-10 20:14:46,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-02-10 20:14:46,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2020-02-10 20:14:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-02-10 20:14:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 330 transitions. [2020-02-10 20:14:46,193 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 330 transitions. Word has length 19 [2020-02-10 20:14:46,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:46,193 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 330 transitions. [2020-02-10 20:14:46,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:46,193 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 330 transitions. [2020-02-10 20:14:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:46,193 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:46,193 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:46,193 INFO L427 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:46,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:46,194 INFO L82 PathProgramCache]: Analyzing trace with hash -916665526, now seen corresponding path program 557 times [2020-02-10 20:14:46,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:46,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553556229] [2020-02-10 20:14:46,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:46,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553556229] [2020-02-10 20:14:46,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:46,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:46,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517317818] [2020-02-10 20:14:46,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:46,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:46,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:46,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:46,397 INFO L87 Difference]: Start difference. First operand 126 states and 330 transitions. Second operand 8 states. [2020-02-10 20:14:46,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:46,458 INFO L93 Difference]: Finished difference Result 209 states and 459 transitions. [2020-02-10 20:14:46,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:46,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:46,459 INFO L225 Difference]: With dead ends: 209 [2020-02-10 20:14:46,459 INFO L226 Difference]: Without dead ends: 199 [2020-02-10 20:14:46,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:46,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-02-10 20:14:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 128. [2020-02-10 20:14:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-02-10 20:14:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 333 transitions. [2020-02-10 20:14:46,463 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 333 transitions. Word has length 19 [2020-02-10 20:14:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:46,463 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 333 transitions. [2020-02-10 20:14:46,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:46,463 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 333 transitions. [2020-02-10 20:14:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:46,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:46,464 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:46,464 INFO L427 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:46,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:46,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1771972180, now seen corresponding path program 558 times [2020-02-10 20:14:46,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:46,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571896395] [2020-02-10 20:14:46,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:46,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571896395] [2020-02-10 20:14:46,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:46,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:46,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871449643] [2020-02-10 20:14:46,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:46,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:46,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:46,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:46,655 INFO L87 Difference]: Start difference. First operand 128 states and 333 transitions. Second operand 8 states. [2020-02-10 20:14:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:46,738 INFO L93 Difference]: Finished difference Result 211 states and 462 transitions. [2020-02-10 20:14:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:46,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:46,739 INFO L225 Difference]: With dead ends: 211 [2020-02-10 20:14:46,739 INFO L226 Difference]: Without dead ends: 194 [2020-02-10 20:14:46,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-02-10 20:14:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 123. [2020-02-10 20:14:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-02-10 20:14:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 323 transitions. [2020-02-10 20:14:46,742 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 323 transitions. Word has length 19 [2020-02-10 20:14:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:46,742 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 323 transitions. [2020-02-10 20:14:46,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 323 transitions. [2020-02-10 20:14:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:46,742 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:46,743 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:46,743 INFO L427 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:46,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:46,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2085582518, now seen corresponding path program 559 times [2020-02-10 20:14:46,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:46,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790663221] [2020-02-10 20:14:46,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:46,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790663221] [2020-02-10 20:14:46,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:46,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:46,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169104559] [2020-02-10 20:14:46,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:46,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:46,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:46,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:46,927 INFO L87 Difference]: Start difference. First operand 123 states and 323 transitions. Second operand 8 states. [2020-02-10 20:14:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:46,988 INFO L93 Difference]: Finished difference Result 215 states and 468 transitions. [2020-02-10 20:14:46,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:46,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:46,989 INFO L225 Difference]: With dead ends: 215 [2020-02-10 20:14:46,989 INFO L226 Difference]: Without dead ends: 199 [2020-02-10 20:14:46,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-02-10 20:14:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 123. [2020-02-10 20:14:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-02-10 20:14:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 320 transitions. [2020-02-10 20:14:46,992 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 320 transitions. Word has length 19 [2020-02-10 20:14:46,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:46,992 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 320 transitions. [2020-02-10 20:14:46,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:46,993 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 320 transitions. [2020-02-10 20:14:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:46,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:46,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:46,993 INFO L427 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:46,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:46,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1826524292, now seen corresponding path program 560 times [2020-02-10 20:14:46,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:46,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142768895] [2020-02-10 20:14:46,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:47,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:14:47,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142768895] [2020-02-10 20:14:47,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:47,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:47,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835029923] [2020-02-10 20:14:47,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:47,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:47,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:47,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:47,179 INFO L87 Difference]: Start difference. First operand 123 states and 320 transitions. Second operand 8 states. [2020-02-10 20:14:47,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:47,243 INFO L93 Difference]: Finished difference Result 209 states and 453 transitions. [2020-02-10 20:14:47,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:47,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:47,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:47,244 INFO L225 Difference]: With dead ends: 209 [2020-02-10 20:14:47,244 INFO L226 Difference]: Without dead ends: 196 [2020-02-10 20:14:47,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-02-10 20:14:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 120. [2020-02-10 20:14:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-02-10 20:14:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 313 transitions. [2020-02-10 20:14:47,247 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 313 transitions. Word has length 19 [2020-02-10 20:14:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:47,248 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 313 transitions. [2020-02-10 20:14:47,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 313 transitions. [2020-02-10 20:14:47,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:47,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:47,248 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:47,248 INFO L427 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:47,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:47,249 INFO L82 PathProgramCache]: Analyzing trace with hash -991490930, now seen corresponding path program 561 times [2020-02-10 20:14:47,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:47,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413545539] [2020-02-10 20:14:47,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:47,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413545539] [2020-02-10 20:14:47,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:47,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:47,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72395704] [2020-02-10 20:14:47,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:47,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:47,446 INFO L87 Difference]: Start difference. First operand 120 states and 313 transitions. Second operand 8 states. [2020-02-10 20:14:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:47,507 INFO L93 Difference]: Finished difference Result 213 states and 467 transitions. [2020-02-10 20:14:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:47,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:47,508 INFO L225 Difference]: With dead ends: 213 [2020-02-10 20:14:47,508 INFO L226 Difference]: Without dead ends: 197 [2020-02-10 20:14:47,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-02-10 20:14:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 126. [2020-02-10 20:14:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-02-10 20:14:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 324 transitions. [2020-02-10 20:14:47,512 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 324 transitions. Word has length 19 [2020-02-10 20:14:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:47,512 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 324 transitions. [2020-02-10 20:14:47,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 324 transitions. [2020-02-10 20:14:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:47,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:47,513 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:47,513 INFO L427 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:47,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:47,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1967695680, now seen corresponding path program 562 times [2020-02-10 20:14:47,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:47,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684322894] [2020-02-10 20:14:47,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:47,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684322894] [2020-02-10 20:14:47,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:47,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:47,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742110397] [2020-02-10 20:14:47,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:47,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:47,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:47,698 INFO L87 Difference]: Start difference. First operand 126 states and 324 transitions. Second operand 8 states. [2020-02-10 20:14:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:47,780 INFO L93 Difference]: Finished difference Result 201 states and 447 transitions. [2020-02-10 20:14:47,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:47,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:47,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:47,781 INFO L225 Difference]: With dead ends: 201 [2020-02-10 20:14:47,781 INFO L226 Difference]: Without dead ends: 182 [2020-02-10 20:14:47,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-02-10 20:14:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 120. [2020-02-10 20:14:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-02-10 20:14:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 310 transitions. [2020-02-10 20:14:47,783 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 310 transitions. Word has length 19 [2020-02-10 20:14:47,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:47,784 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 310 transitions. [2020-02-10 20:14:47,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 310 transitions. [2020-02-10 20:14:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:47,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:47,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:47,784 INFO L427 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:47,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:47,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1019871656, now seen corresponding path program 563 times [2020-02-10 20:14:47,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:47,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397467787] [2020-02-10 20:14:47,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:47,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:14:47,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397467787] [2020-02-10 20:14:47,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:47,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:47,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118380870] [2020-02-10 20:14:47,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:47,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:47,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:47,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:47,990 INFO L87 Difference]: Start difference. First operand 120 states and 310 transitions. Second operand 8 states. [2020-02-10 20:14:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:48,057 INFO L93 Difference]: Finished difference Result 203 states and 440 transitions. [2020-02-10 20:14:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:48,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:48,058 INFO L225 Difference]: With dead ends: 203 [2020-02-10 20:14:48,058 INFO L226 Difference]: Without dead ends: 193 [2020-02-10 20:14:48,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-02-10 20:14:48,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 122. [2020-02-10 20:14:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-02-10 20:14:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 313 transitions. [2020-02-10 20:14:48,062 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 313 transitions. Word has length 19 [2020-02-10 20:14:48,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:48,062 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 313 transitions. [2020-02-10 20:14:48,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:48,062 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 313 transitions. [2020-02-10 20:14:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:48,062 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:48,062 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:48,062 INFO L427 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:48,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:48,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1785690644, now seen corresponding path program 564 times [2020-02-10 20:14:48,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:48,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251717210] [2020-02-10 20:14:48,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:48,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:14:48,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251717210] [2020-02-10 20:14:48,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:48,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:48,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562873248] [2020-02-10 20:14:48,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:48,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:48,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:48,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:48,269 INFO L87 Difference]: Start difference. First operand 122 states and 313 transitions. Second operand 8 states. [2020-02-10 20:14:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:48,345 INFO L93 Difference]: Finished difference Result 197 states and 436 transitions. [2020-02-10 20:14:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:48,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:48,346 INFO L225 Difference]: With dead ends: 197 [2020-02-10 20:14:48,347 INFO L226 Difference]: Without dead ends: 179 [2020-02-10 20:14:48,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:48,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-02-10 20:14:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2020-02-10 20:14:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-02-10 20:14:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 303 transitions. [2020-02-10 20:14:48,349 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 303 transitions. Word has length 19 [2020-02-10 20:14:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:48,349 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 303 transitions. [2020-02-10 20:14:48,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 303 transitions. [2020-02-10 20:14:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:48,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:48,350 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:48,350 INFO L427 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:48,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:48,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1759986294, now seen corresponding path program 565 times [2020-02-10 20:14:48,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:48,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583168677] [2020-02-10 20:14:48,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:48,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583168677] [2020-02-10 20:14:48,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:48,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:48,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417477086] [2020-02-10 20:14:48,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:48,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:48,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:48,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:48,549 INFO L87 Difference]: Start difference. First operand 117 states and 303 transitions. Second operand 8 states. [2020-02-10 20:14:48,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:48,613 INFO L93 Difference]: Finished difference Result 207 states and 450 transitions. [2020-02-10 20:14:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:48,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:48,614 INFO L225 Difference]: With dead ends: 207 [2020-02-10 20:14:48,614 INFO L226 Difference]: Without dead ends: 191 [2020-02-10 20:14:48,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-02-10 20:14:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 117. [2020-02-10 20:14:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-02-10 20:14:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 298 transitions. [2020-02-10 20:14:48,618 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 298 transitions. Word has length 19 [2020-02-10 20:14:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:48,618 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 298 transitions. [2020-02-10 20:14:48,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 298 transitions. [2020-02-10 20:14:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:48,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:48,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:48,619 INFO L427 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:48,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:48,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1783918908, now seen corresponding path program 566 times [2020-02-10 20:14:48,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:48,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737666138] [2020-02-10 20:14:48,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:48,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737666138] [2020-02-10 20:14:48,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:48,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:48,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302522141] [2020-02-10 20:14:48,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:48,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:48,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:48,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:48,816 INFO L87 Difference]: Start difference. First operand 117 states and 298 transitions. Second operand 8 states. [2020-02-10 20:14:48,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:48,899 INFO L93 Difference]: Finished difference Result 203 states and 438 transitions. [2020-02-10 20:14:48,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:48,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:48,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:48,900 INFO L225 Difference]: With dead ends: 203 [2020-02-10 20:14:48,900 INFO L226 Difference]: Without dead ends: 186 [2020-02-10 20:14:48,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-02-10 20:14:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 112. [2020-02-10 20:14:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-02-10 20:14:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 284 transitions. [2020-02-10 20:14:48,903 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 284 transitions. Word has length 19 [2020-02-10 20:14:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:48,903 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 284 transitions. [2020-02-10 20:14:48,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 284 transitions. [2020-02-10 20:14:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:48,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:48,904 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:48,904 INFO L427 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:48,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:48,904 INFO L82 PathProgramCache]: Analyzing trace with hash 934543148, now seen corresponding path program 567 times [2020-02-10 20:14:48,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:48,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793587179] [2020-02-10 20:14:48,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:49,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:49,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793587179] [2020-02-10 20:14:49,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:49,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:49,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753922696] [2020-02-10 20:14:49,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:49,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:49,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:49,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:49,102 INFO L87 Difference]: Start difference. First operand 112 states and 284 transitions. Second operand 8 states. [2020-02-10 20:14:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:49,160 INFO L93 Difference]: Finished difference Result 195 states and 418 transitions. [2020-02-10 20:14:49,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:49,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:49,161 INFO L225 Difference]: With dead ends: 195 [2020-02-10 20:14:49,161 INFO L226 Difference]: Without dead ends: 179 [2020-02-10 20:14:49,161 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-02-10 20:14:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 104. [2020-02-10 20:14:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-02-10 20:14:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 263 transitions. [2020-02-10 20:14:49,164 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 263 transitions. Word has length 19 [2020-02-10 20:14:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:49,164 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 263 transitions. [2020-02-10 20:14:49,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 263 transitions. [2020-02-10 20:14:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:49,164 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:49,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:49,165 INFO L427 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:49,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:49,165 INFO L82 PathProgramCache]: Analyzing trace with hash -41661602, now seen corresponding path program 568 times [2020-02-10 20:14:49,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:49,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847635469] [2020-02-10 20:14:49,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:49,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847635469] [2020-02-10 20:14:49,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:49,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:49,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618442233] [2020-02-10 20:14:49,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:49,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:49,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:49,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:49,356 INFO L87 Difference]: Start difference. First operand 104 states and 263 transitions. Second operand 8 states. [2020-02-10 20:14:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:49,441 INFO L93 Difference]: Finished difference Result 183 states and 398 transitions. [2020-02-10 20:14:49,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:49,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:49,442 INFO L225 Difference]: With dead ends: 183 [2020-02-10 20:14:49,442 INFO L226 Difference]: Without dead ends: 164 [2020-02-10 20:14:49,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-02-10 20:14:49,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 98. [2020-02-10 20:14:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 20:14:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 247 transitions. [2020-02-10 20:14:49,444 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 247 transitions. Word has length 19 [2020-02-10 20:14:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:49,444 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 247 transitions. [2020-02-10 20:14:49,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 247 transitions. [2020-02-10 20:14:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:49,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:49,445 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:49,445 INFO L427 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1586342730, now seen corresponding path program 569 times [2020-02-10 20:14:49,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:49,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912703265] [2020-02-10 20:14:49,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:49,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912703265] [2020-02-10 20:14:49,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:49,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:49,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791025103] [2020-02-10 20:14:49,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:49,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:49,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:49,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:49,638 INFO L87 Difference]: Start difference. First operand 98 states and 247 transitions. Second operand 8 states. [2020-02-10 20:14:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:49,722 INFO L93 Difference]: Finished difference Result 180 states and 392 transitions. [2020-02-10 20:14:49,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:49,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:49,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:49,723 INFO L225 Difference]: With dead ends: 180 [2020-02-10 20:14:49,723 INFO L226 Difference]: Without dead ends: 168 [2020-02-10 20:14:49,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-02-10 20:14:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 102. [2020-02-10 20:14:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-02-10 20:14:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 255 transitions. [2020-02-10 20:14:49,726 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 255 transitions. Word has length 19 [2020-02-10 20:14:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:49,726 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 255 transitions. [2020-02-10 20:14:49,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 255 transitions. [2020-02-10 20:14:49,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:49,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:49,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:49,727 INFO L427 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:49,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:49,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1849750036, now seen corresponding path program 570 times [2020-02-10 20:14:49,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:49,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129093683] [2020-02-10 20:14:49,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:49,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129093683] [2020-02-10 20:14:49,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:49,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:49,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723325662] [2020-02-10 20:14:49,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:49,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:49,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:49,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:49,919 INFO L87 Difference]: Start difference. First operand 102 states and 255 transitions. Second operand 8 states. [2020-02-10 20:14:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:50,003 INFO L93 Difference]: Finished difference Result 167 states and 371 transitions. [2020-02-10 20:14:50,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:50,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:50,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:50,004 INFO L225 Difference]: With dead ends: 167 [2020-02-10 20:14:50,005 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:14:50,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:14:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-02-10 20:14:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:14:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 235 transitions. [2020-02-10 20:14:50,007 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 235 transitions. Word has length 19 [2020-02-10 20:14:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:50,007 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 235 transitions. [2020-02-10 20:14:50,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 235 transitions. [2020-02-10 20:14:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:50,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:50,008 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:50,008 INFO L427 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1422262942, now seen corresponding path program 571 times [2020-02-10 20:14:50,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:50,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155540655] [2020-02-10 20:14:50,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:50,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155540655] [2020-02-10 20:14:50,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:50,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:50,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290890563] [2020-02-10 20:14:50,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:50,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:50,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:50,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:50,204 INFO L87 Difference]: Start difference. First operand 93 states and 235 transitions. Second operand 8 states. [2020-02-10 20:14:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:50,271 INFO L93 Difference]: Finished difference Result 172 states and 373 transitions. [2020-02-10 20:14:50,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:50,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:50,272 INFO L225 Difference]: With dead ends: 172 [2020-02-10 20:14:50,272 INFO L226 Difference]: Without dead ends: 162 [2020-02-10 20:14:50,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-02-10 20:14:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 97. [2020-02-10 20:14:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:14:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 245 transitions. [2020-02-10 20:14:50,275 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 245 transitions. Word has length 19 [2020-02-10 20:14:50,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:50,275 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 245 transitions. [2020-02-10 20:14:50,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 245 transitions. [2020-02-10 20:14:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:50,276 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:50,276 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:50,276 INFO L427 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:50,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:50,276 INFO L82 PathProgramCache]: Analyzing trace with hash 566956288, now seen corresponding path program 572 times [2020-02-10 20:14:50,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:50,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443676233] [2020-02-10 20:14:50,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:50,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443676233] [2020-02-10 20:14:50,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:50,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:50,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100591823] [2020-02-10 20:14:50,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:50,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:50,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:50,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:50,475 INFO L87 Difference]: Start difference. First operand 97 states and 245 transitions. Second operand 8 states. [2020-02-10 20:14:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:50,556 INFO L93 Difference]: Finished difference Result 174 states and 376 transitions. [2020-02-10 20:14:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:50,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:50,557 INFO L225 Difference]: With dead ends: 174 [2020-02-10 20:14:50,557 INFO L226 Difference]: Without dead ends: 160 [2020-02-10 20:14:50,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:50,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-02-10 20:14:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 95. [2020-02-10 20:14:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:14:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 240 transitions. [2020-02-10 20:14:50,559 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 240 transitions. Word has length 19 [2020-02-10 20:14:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:50,560 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 240 transitions. [2020-02-10 20:14:50,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 240 transitions. [2020-02-10 20:14:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:50,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:50,560 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:50,560 INFO L427 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:50,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:50,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1261763396, now seen corresponding path program 573 times [2020-02-10 20:14:50,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:50,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830223138] [2020-02-10 20:14:50,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:50,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830223138] [2020-02-10 20:14:50,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:50,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:50,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845352475] [2020-02-10 20:14:50,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:50,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:50,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:50,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:50,757 INFO L87 Difference]: Start difference. First operand 95 states and 240 transitions. Second operand 8 states. [2020-02-10 20:14:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:50,827 INFO L93 Difference]: Finished difference Result 168 states and 363 transitions. [2020-02-10 20:14:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:50,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:50,828 INFO L225 Difference]: With dead ends: 168 [2020-02-10 20:14:50,828 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 20:14:50,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:50,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 20:14:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 97. [2020-02-10 20:14:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:14:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 243 transitions. [2020-02-10 20:14:50,831 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 243 transitions. Word has length 19 [2020-02-10 20:14:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:50,831 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 243 transitions. [2020-02-10 20:14:50,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 243 transitions. [2020-02-10 20:14:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:50,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:50,832 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:50,832 INFO L427 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:50,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:50,832 INFO L82 PathProgramCache]: Analyzing trace with hash 227641600, now seen corresponding path program 574 times [2020-02-10 20:14:50,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:50,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128586896] [2020-02-10 20:14:50,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:51,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128586896] [2020-02-10 20:14:51,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:51,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:51,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322994243] [2020-02-10 20:14:51,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:51,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:51,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:51,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:51,023 INFO L87 Difference]: Start difference. First operand 97 states and 243 transitions. Second operand 8 states. [2020-02-10 20:14:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:51,112 INFO L93 Difference]: Finished difference Result 162 states and 359 transitions. [2020-02-10 20:14:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:51,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:51,113 INFO L225 Difference]: With dead ends: 162 [2020-02-10 20:14:51,113 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 20:14:51,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 20:14:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 95. [2020-02-10 20:14:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:14:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 238 transitions. [2020-02-10 20:14:51,116 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 238 transitions. Word has length 19 [2020-02-10 20:14:51,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:51,116 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 238 transitions. [2020-02-10 20:14:51,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 238 transitions. [2020-02-10 20:14:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:51,117 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:51,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:51,117 INFO L427 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:51,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:51,117 INFO L82 PathProgramCache]: Analyzing trace with hash -506129092, now seen corresponding path program 575 times [2020-02-10 20:14:51,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:51,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087744840] [2020-02-10 20:14:51,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:51,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087744840] [2020-02-10 20:14:51,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:51,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:51,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624528504] [2020-02-10 20:14:51,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:51,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:51,308 INFO L87 Difference]: Start difference. First operand 95 states and 238 transitions. Second operand 8 states. [2020-02-10 20:14:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:51,393 INFO L93 Difference]: Finished difference Result 155 states and 344 transitions. [2020-02-10 20:14:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:51,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:51,394 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:14:51,394 INFO L226 Difference]: Without dead ends: 143 [2020-02-10 20:14:51,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:51,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-02-10 20:14:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 99. [2020-02-10 20:14:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-02-10 20:14:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 246 transitions. [2020-02-10 20:14:51,397 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 246 transitions. Word has length 19 [2020-02-10 20:14:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:51,397 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 246 transitions. [2020-02-10 20:14:51,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 246 transitions. [2020-02-10 20:14:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:51,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:51,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:51,398 INFO L427 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1261763396, now seen corresponding path program 576 times [2020-02-10 20:14:51,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:51,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667450445] [2020-02-10 20:14:51,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:51,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667450445] [2020-02-10 20:14:51,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:51,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:51,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975686419] [2020-02-10 20:14:51,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:51,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:51,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:51,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:51,591 INFO L87 Difference]: Start difference. First operand 99 states and 246 transitions. Second operand 8 states. [2020-02-10 20:14:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:51,674 INFO L93 Difference]: Finished difference Result 142 states and 323 transitions. [2020-02-10 20:14:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:51,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:51,675 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:14:51,675 INFO L226 Difference]: Without dead ends: 120 [2020-02-10 20:14:51,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-02-10 20:14:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2020-02-10 20:14:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:14:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 229 transitions. [2020-02-10 20:14:51,677 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 229 transitions. Word has length 19 [2020-02-10 20:14:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:51,678 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 229 transitions. [2020-02-10 20:14:51,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 229 transitions. [2020-02-10 20:14:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:51,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:51,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:51,678 INFO L427 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:51,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1776969654, now seen corresponding path program 577 times [2020-02-10 20:14:51,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:51,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189744978] [2020-02-10 20:14:51,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:51,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189744978] [2020-02-10 20:14:51,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:51,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:51,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744792751] [2020-02-10 20:14:51,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:51,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:51,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:51,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:51,895 INFO L87 Difference]: Start difference. First operand 90 states and 229 transitions. Second operand 8 states. [2020-02-10 20:14:51,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:51,982 INFO L93 Difference]: Finished difference Result 165 states and 357 transitions. [2020-02-10 20:14:51,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:51,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:51,983 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:14:51,984 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 20:14:51,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 20:14:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 93. [2020-02-10 20:14:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:14:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 237 transitions. [2020-02-10 20:14:51,987 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 237 transitions. Word has length 19 [2020-02-10 20:14:51,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:51,987 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 237 transitions. [2020-02-10 20:14:51,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 237 transitions. [2020-02-10 20:14:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:51,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:51,988 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:51,988 INFO L427 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:51,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:51,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2016611992, now seen corresponding path program 578 times [2020-02-10 20:14:51,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:51,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843435730] [2020-02-10 20:14:51,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:52,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843435730] [2020-02-10 20:14:52,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:52,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:52,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438001565] [2020-02-10 20:14:52,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:52,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:52,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:52,208 INFO L87 Difference]: Start difference. First operand 93 states and 237 transitions. Second operand 8 states. [2020-02-10 20:14:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:52,276 INFO L93 Difference]: Finished difference Result 165 states and 356 transitions. [2020-02-10 20:14:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:52,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:52,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:52,277 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:14:52,277 INFO L226 Difference]: Without dead ends: 154 [2020-02-10 20:14:52,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-02-10 20:14:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 92. [2020-02-10 20:14:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:14:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 235 transitions. [2020-02-10 20:14:52,280 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 235 transitions. Word has length 19 [2020-02-10 20:14:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:52,281 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 235 transitions. [2020-02-10 20:14:52,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 235 transitions. [2020-02-10 20:14:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:52,281 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:52,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:52,281 INFO L427 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:52,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:52,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1773295144, now seen corresponding path program 579 times [2020-02-10 20:14:52,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:52,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377000746] [2020-02-10 20:14:52,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:52,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377000746] [2020-02-10 20:14:52,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:52,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:52,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502905036] [2020-02-10 20:14:52,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:52,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:52,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:52,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:52,490 INFO L87 Difference]: Start difference. First operand 92 states and 235 transitions. Second operand 8 states. [2020-02-10 20:14:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:52,577 INFO L93 Difference]: Finished difference Result 168 states and 364 transitions. [2020-02-10 20:14:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:52,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:52,577 INFO L225 Difference]: With dead ends: 168 [2020-02-10 20:14:52,578 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 20:14:52,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:52,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 20:14:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2020-02-10 20:14:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:14:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 238 transitions. [2020-02-10 20:14:52,580 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 238 transitions. Word has length 19 [2020-02-10 20:14:52,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:52,581 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 238 transitions. [2020-02-10 20:14:52,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 238 transitions. [2020-02-10 20:14:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:52,581 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:52,581 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:52,581 INFO L427 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:52,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:52,581 INFO L82 PathProgramCache]: Analyzing trace with hash -811058844, now seen corresponding path program 580 times [2020-02-10 20:14:52,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:52,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761761693] [2020-02-10 20:14:52,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:52,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761761693] [2020-02-10 20:14:52,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:52,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:52,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231505605] [2020-02-10 20:14:52,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:52,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:52,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:52,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:52,788 INFO L87 Difference]: Start difference. First operand 94 states and 238 transitions. Second operand 8 states. [2020-02-10 20:14:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:52,877 INFO L93 Difference]: Finished difference Result 170 states and 367 transitions. [2020-02-10 20:14:52,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:52,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:52,878 INFO L225 Difference]: With dead ends: 170 [2020-02-10 20:14:52,878 INFO L226 Difference]: Without dead ends: 156 [2020-02-10 20:14:52,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:52,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-02-10 20:14:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 92. [2020-02-10 20:14:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:14:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-02-10 20:14:52,881 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-02-10 20:14:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:52,881 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-02-10 20:14:52,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-02-10 20:14:52,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:52,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:52,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:52,882 INFO L427 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:52,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:52,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1205269924, now seen corresponding path program 581 times [2020-02-10 20:14:52,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:52,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005121325] [2020-02-10 20:14:52,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:53,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005121325] [2020-02-10 20:14:53,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:53,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:53,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901580125] [2020-02-10 20:14:53,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:53,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:53,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:53,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:53,099 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-02-10 20:14:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:53,166 INFO L93 Difference]: Finished difference Result 168 states and 363 transitions. [2020-02-10 20:14:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:53,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:53,167 INFO L225 Difference]: With dead ends: 168 [2020-02-10 20:14:53,167 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 20:14:53,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 20:14:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2020-02-10 20:14:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:14:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-02-10 20:14:53,170 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-02-10 20:14:53,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:53,170 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-02-10 20:14:53,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-02-10 20:14:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:53,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:53,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:53,170 INFO L427 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:53,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:53,170 INFO L82 PathProgramCache]: Analyzing trace with hash 349963270, now seen corresponding path program 582 times [2020-02-10 20:14:53,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:53,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045236507] [2020-02-10 20:14:53,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:53,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:14:53,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045236507] [2020-02-10 20:14:53,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:53,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:53,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126521360] [2020-02-10 20:14:53,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:53,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:53,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:53,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:53,384 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-02-10 20:14:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:53,464 INFO L93 Difference]: Finished difference Result 170 states and 366 transitions. [2020-02-10 20:14:53,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:53,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:53,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:53,465 INFO L225 Difference]: With dead ends: 170 [2020-02-10 20:14:53,465 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 20:14:53,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 20:14:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 91. [2020-02-10 20:14:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:14:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 232 transitions. [2020-02-10 20:14:53,468 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 232 transitions. Word has length 19 [2020-02-10 20:14:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:53,468 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 232 transitions. [2020-02-10 20:14:53,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 232 transitions. [2020-02-10 20:14:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:53,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:53,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:53,469 INFO L427 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:53,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:53,469 INFO L82 PathProgramCache]: Analyzing trace with hash 917559788, now seen corresponding path program 583 times [2020-02-10 20:14:53,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:53,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894315979] [2020-02-10 20:14:53,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:53,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894315979] [2020-02-10 20:14:53,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:53,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:53,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822757547] [2020-02-10 20:14:53,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:53,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:53,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:53,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:53,713 INFO L87 Difference]: Start difference. First operand 91 states and 232 transitions. Second operand 8 states. [2020-02-10 20:14:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:53,805 INFO L93 Difference]: Finished difference Result 163 states and 351 transitions. [2020-02-10 20:14:53,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:53,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:53,806 INFO L225 Difference]: With dead ends: 163 [2020-02-10 20:14:53,806 INFO L226 Difference]: Without dead ends: 153 [2020-02-10 20:14:53,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:53,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-02-10 20:14:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 93. [2020-02-10 20:14:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:14:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 236 transitions. [2020-02-10 20:14:53,808 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 236 transitions. Word has length 19 [2020-02-10 20:14:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:53,808 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 236 transitions. [2020-02-10 20:14:53,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 236 transitions. [2020-02-10 20:14:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:53,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:53,809 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:53,809 INFO L427 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:53,809 INFO L82 PathProgramCache]: Analyzing trace with hash 677917450, now seen corresponding path program 584 times [2020-02-10 20:14:53,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:53,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131645268] [2020-02-10 20:14:53,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:54,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:14:54,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131645268] [2020-02-10 20:14:54,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:54,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:54,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825424671] [2020-02-10 20:14:54,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:54,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:54,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:54,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:54,025 INFO L87 Difference]: Start difference. First operand 93 states and 236 transitions. Second operand 8 states. [2020-02-10 20:14:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:54,097 INFO L93 Difference]: Finished difference Result 163 states and 350 transitions. [2020-02-10 20:14:54,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:54,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:54,098 INFO L225 Difference]: With dead ends: 163 [2020-02-10 20:14:54,098 INFO L226 Difference]: Without dead ends: 152 [2020-02-10 20:14:54,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:54,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-02-10 20:14:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 92. [2020-02-10 20:14:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:14:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-02-10 20:14:54,101 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-02-10 20:14:54,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:54,101 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-02-10 20:14:54,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-02-10 20:14:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:54,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:54,101 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:54,101 INFO L427 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:54,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:54,102 INFO L82 PathProgramCache]: Analyzing trace with hash -155525592, now seen corresponding path program 585 times [2020-02-10 20:14:54,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:54,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812894515] [2020-02-10 20:14:54,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:54,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:14:54,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812894515] [2020-02-10 20:14:54,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:54,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:54,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448962884] [2020-02-10 20:14:54,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:54,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:54,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:54,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:54,301 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-02-10 20:14:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:54,388 INFO L93 Difference]: Finished difference Result 165 states and 357 transitions. [2020-02-10 20:14:54,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:54,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:54,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:54,389 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:14:54,389 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 20:14:54,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 20:14:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 94. [2020-02-10 20:14:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:14:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-02-10 20:14:54,391 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-02-10 20:14:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:54,392 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-02-10 20:14:54,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-02-10 20:14:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:54,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:54,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:54,392 INFO L427 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:54,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash 799453412, now seen corresponding path program 586 times [2020-02-10 20:14:54,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:54,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764422653] [2020-02-10 20:14:54,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:54,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764422653] [2020-02-10 20:14:54,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:54,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:54,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684525224] [2020-02-10 20:14:54,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:54,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:54,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:54,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:54,595 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-02-10 20:14:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:54,684 INFO L93 Difference]: Finished difference Result 159 states and 353 transitions. [2020-02-10 20:14:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:54,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:54,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:54,685 INFO L225 Difference]: With dead ends: 159 [2020-02-10 20:14:54,685 INFO L226 Difference]: Without dead ends: 144 [2020-02-10 20:14:54,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-02-10 20:14:54,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92. [2020-02-10 20:14:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:14:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 233 transitions. [2020-02-10 20:14:54,688 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 233 transitions. Word has length 19 [2020-02-10 20:14:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:54,688 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 233 transitions. [2020-02-10 20:14:54,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 233 transitions. [2020-02-10 20:14:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:54,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:54,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:54,688 INFO L427 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:54,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:54,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1215773028, now seen corresponding path program 587 times [2020-02-10 20:14:54,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:54,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549826580] [2020-02-10 20:14:54,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:54,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549826580] [2020-02-10 20:14:54,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:54,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:54,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182950881] [2020-02-10 20:14:54,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:54,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:54,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:54,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:54,892 INFO L87 Difference]: Start difference. First operand 92 states and 233 transitions. Second operand 8 states. [2020-02-10 20:14:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:54,969 INFO L93 Difference]: Finished difference Result 165 states and 356 transitions. [2020-02-10 20:14:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:54,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:54,970 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:14:54,970 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 20:14:54,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 20:14:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 94. [2020-02-10 20:14:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:14:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 236 transitions. [2020-02-10 20:14:54,973 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 236 transitions. Word has length 19 [2020-02-10 20:14:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:54,973 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 236 transitions. [2020-02-10 20:14:54,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 236 transitions. [2020-02-10 20:14:54,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:54,973 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:54,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:54,974 INFO L427 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:54,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:54,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1589789272, now seen corresponding path program 588 times [2020-02-10 20:14:54,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:54,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661294649] [2020-02-10 20:14:54,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:55,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661294649] [2020-02-10 20:14:55,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:55,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:55,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026388045] [2020-02-10 20:14:55,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:55,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:55,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:55,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:55,175 INFO L87 Difference]: Start difference. First operand 94 states and 236 transitions. Second operand 8 states. [2020-02-10 20:14:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:55,268 INFO L93 Difference]: Finished difference Result 159 states and 352 transitions. [2020-02-10 20:14:55,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:55,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:55,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:55,269 INFO L225 Difference]: With dead ends: 159 [2020-02-10 20:14:55,269 INFO L226 Difference]: Without dead ends: 143 [2020-02-10 20:14:55,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-02-10 20:14:55,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 91. [2020-02-10 20:14:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:14:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 231 transitions. [2020-02-10 20:14:55,272 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 231 transitions. Word has length 19 [2020-02-10 20:14:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:55,272 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 231 transitions. [2020-02-10 20:14:55,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 231 transitions. [2020-02-10 20:14:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:55,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:55,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:55,272 INFO L427 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:55,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1427580564, now seen corresponding path program 589 times [2020-02-10 20:14:55,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:55,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903952524] [2020-02-10 20:14:55,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:55,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:55,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903952524] [2020-02-10 20:14:55,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:55,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:55,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993341327] [2020-02-10 20:14:55,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:55,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:55,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:55,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:55,477 INFO L87 Difference]: Start difference. First operand 91 states and 231 transitions. Second operand 8 states. [2020-02-10 20:14:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:55,564 INFO L93 Difference]: Finished difference Result 161 states and 347 transitions. [2020-02-10 20:14:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:55,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:55,565 INFO L225 Difference]: With dead ends: 161 [2020-02-10 20:14:55,565 INFO L226 Difference]: Without dead ends: 151 [2020-02-10 20:14:55,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-02-10 20:14:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 95. [2020-02-10 20:14:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:14:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 241 transitions. [2020-02-10 20:14:55,568 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 241 transitions. Word has length 19 [2020-02-10 20:14:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:55,568 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 241 transitions. [2020-02-10 20:14:55,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 241 transitions. [2020-02-10 20:14:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:55,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:55,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:55,569 INFO L427 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash 283032744, now seen corresponding path program 590 times [2020-02-10 20:14:55,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:55,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230699577] [2020-02-10 20:14:55,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:55,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230699577] [2020-02-10 20:14:55,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:55,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:55,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61286343] [2020-02-10 20:14:55,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:55,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:55,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:55,776 INFO L87 Difference]: Start difference. First operand 95 states and 241 transitions. Second operand 8 states. [2020-02-10 20:14:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:55,866 INFO L93 Difference]: Finished difference Result 163 states and 350 transitions. [2020-02-10 20:14:55,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:55,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:55,867 INFO L225 Difference]: With dead ends: 163 [2020-02-10 20:14:55,867 INFO L226 Difference]: Without dead ends: 149 [2020-02-10 20:14:55,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-02-10 20:14:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2020-02-10 20:14:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:14:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 236 transitions. [2020-02-10 20:14:55,870 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 236 transitions. Word has length 19 [2020-02-10 20:14:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:55,870 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 236 transitions. [2020-02-10 20:14:55,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 236 transitions. [2020-02-10 20:14:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:55,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:55,871 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:55,871 INFO L427 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:55,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:55,872 INFO L82 PathProgramCache]: Analyzing trace with hash 917559788, now seen corresponding path program 591 times [2020-02-10 20:14:55,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:55,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807066629] [2020-02-10 20:14:55,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:56,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:56,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807066629] [2020-02-10 20:14:56,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:56,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:56,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702461930] [2020-02-10 20:14:56,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:56,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:56,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:56,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:56,066 INFO L87 Difference]: Start difference. First operand 93 states and 236 transitions. Second operand 8 states. [2020-02-10 20:14:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:56,157 INFO L93 Difference]: Finished difference Result 158 states and 339 transitions. [2020-02-10 20:14:56,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:56,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:56,158 INFO L225 Difference]: With dead ends: 158 [2020-02-10 20:14:56,158 INFO L226 Difference]: Without dead ends: 148 [2020-02-10 20:14:56,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:56,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-02-10 20:14:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 95. [2020-02-10 20:14:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:14:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 239 transitions. [2020-02-10 20:14:56,161 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 239 transitions. Word has length 19 [2020-02-10 20:14:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:56,161 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 239 transitions. [2020-02-10 20:14:56,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 239 transitions. [2020-02-10 20:14:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:56,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:56,162 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:56,162 INFO L427 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:56,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:56,162 INFO L82 PathProgramCache]: Analyzing trace with hash -811487546, now seen corresponding path program 592 times [2020-02-10 20:14:56,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:56,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202239420] [2020-02-10 20:14:56,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:56,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:14:56,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202239420] [2020-02-10 20:14:56,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:56,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:56,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57169877] [2020-02-10 20:14:56,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:56,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:56,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:56,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:56,368 INFO L87 Difference]: Start difference. First operand 95 states and 239 transitions. Second operand 8 states. [2020-02-10 20:14:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:56,457 INFO L93 Difference]: Finished difference Result 152 states and 335 transitions. [2020-02-10 20:14:56,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:56,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:56,458 INFO L225 Difference]: With dead ends: 152 [2020-02-10 20:14:56,458 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 20:14:56,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 20:14:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 93. [2020-02-10 20:14:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:14:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 234 transitions. [2020-02-10 20:14:56,461 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 234 transitions. Word has length 19 [2020-02-10 20:14:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:56,461 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 234 transitions. [2020-02-10 20:14:56,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 234 transitions. [2020-02-10 20:14:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:56,462 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:56,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:56,462 INFO L427 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:56,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:56,462 INFO L82 PathProgramCache]: Analyzing trace with hash -177389204, now seen corresponding path program 593 times [2020-02-10 20:14:56,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:56,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509343094] [2020-02-10 20:14:56,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:56,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509343094] [2020-02-10 20:14:56,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:56,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:56,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393321233] [2020-02-10 20:14:56,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:56,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:56,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:56,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:56,666 INFO L87 Difference]: Start difference. First operand 93 states and 234 transitions. Second operand 8 states. [2020-02-10 20:14:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:56,741 INFO L93 Difference]: Finished difference Result 153 states and 340 transitions. [2020-02-10 20:14:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:56,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:56,742 INFO L225 Difference]: With dead ends: 153 [2020-02-10 20:14:56,743 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 20:14:56,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 20:14:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 97. [2020-02-10 20:14:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:14:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 242 transitions. [2020-02-10 20:14:56,745 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 242 transitions. Word has length 19 [2020-02-10 20:14:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:56,746 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 242 transitions. [2020-02-10 20:14:56,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 242 transitions. [2020-02-10 20:14:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:56,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:56,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:56,747 INFO L427 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:56,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:56,747 INFO L82 PathProgramCache]: Analyzing trace with hash 677917450, now seen corresponding path program 594 times [2020-02-10 20:14:56,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:56,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401456463] [2020-02-10 20:14:56,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:56,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401456463] [2020-02-10 20:14:56,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:56,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:56,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701725978] [2020-02-10 20:14:56,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:56,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:56,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:56,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:56,963 INFO L87 Difference]: Start difference. First operand 97 states and 242 transitions. Second operand 8 states. [2020-02-10 20:14:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:57,059 INFO L93 Difference]: Finished difference Result 140 states and 319 transitions. [2020-02-10 20:14:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:57,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:57,060 INFO L225 Difference]: With dead ends: 140 [2020-02-10 20:14:57,060 INFO L226 Difference]: Without dead ends: 121 [2020-02-10 20:14:57,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:57,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-02-10 20:14:57,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 91. [2020-02-10 20:14:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:14:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 230 transitions. [2020-02-10 20:14:57,063 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 230 transitions. Word has length 19 [2020-02-10 20:14:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:57,063 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 230 transitions. [2020-02-10 20:14:57,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 230 transitions. [2020-02-10 20:14:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:57,064 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:57,064 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:57,064 INFO L427 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:57,064 INFO L82 PathProgramCache]: Analyzing trace with hash 698923658, now seen corresponding path program 595 times [2020-02-10 20:14:57,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:57,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147061733] [2020-02-10 20:14:57,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:57,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147061733] [2020-02-10 20:14:57,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:57,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:57,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066162235] [2020-02-10 20:14:57,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:57,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:57,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:57,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:57,279 INFO L87 Difference]: Start difference. First operand 91 states and 230 transitions. Second operand 8 states. [2020-02-10 20:14:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:57,333 INFO L93 Difference]: Finished difference Result 140 states and 309 transitions. [2020-02-10 20:14:57,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:57,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:57,334 INFO L225 Difference]: With dead ends: 140 [2020-02-10 20:14:57,334 INFO L226 Difference]: Without dead ends: 130 [2020-02-10 20:14:57,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:57,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-02-10 20:14:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2020-02-10 20:14:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:14:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 240 transitions. [2020-02-10 20:14:57,337 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 240 transitions. Word has length 19 [2020-02-10 20:14:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:57,337 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 240 transitions. [2020-02-10 20:14:57,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 240 transitions. [2020-02-10 20:14:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:57,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:57,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:57,338 INFO L427 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash -156382996, now seen corresponding path program 596 times [2020-02-10 20:14:57,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:57,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781052327] [2020-02-10 20:14:57,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:57,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781052327] [2020-02-10 20:14:57,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:57,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:57,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539057635] [2020-02-10 20:14:57,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:57,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:57,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:57,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:57,542 INFO L87 Difference]: Start difference. First operand 95 states and 240 transitions. Second operand 8 states. [2020-02-10 20:14:57,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:57,630 INFO L93 Difference]: Finished difference Result 142 states and 312 transitions. [2020-02-10 20:14:57,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:57,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:57,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:57,631 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:14:57,631 INFO L226 Difference]: Without dead ends: 128 [2020-02-10 20:14:57,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-02-10 20:14:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2020-02-10 20:14:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:14:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 235 transitions. [2020-02-10 20:14:57,633 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 235 transitions. Word has length 19 [2020-02-10 20:14:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:57,634 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 235 transitions. [2020-02-10 20:14:57,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 235 transitions. [2020-02-10 20:14:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:57,634 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:57,634 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:57,634 INFO L427 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:57,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:57,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1985102680, now seen corresponding path program 597 times [2020-02-10 20:14:57,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:57,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394763009] [2020-02-10 20:14:57,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:57,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394763009] [2020-02-10 20:14:57,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:57,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:57,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355123078] [2020-02-10 20:14:57,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:57,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:57,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:57,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:57,846 INFO L87 Difference]: Start difference. First operand 93 states and 235 transitions. Second operand 8 states. [2020-02-10 20:14:57,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:57,912 INFO L93 Difference]: Finished difference Result 136 states and 299 transitions. [2020-02-10 20:14:57,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:57,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:57,913 INFO L225 Difference]: With dead ends: 136 [2020-02-10 20:14:57,913 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 20:14:57,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 20:14:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2020-02-10 20:14:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:14:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 238 transitions. [2020-02-10 20:14:57,916 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 238 transitions. Word has length 19 [2020-02-10 20:14:57,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:57,916 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 238 transitions. [2020-02-10 20:14:57,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 238 transitions. [2020-02-10 20:14:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:57,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:57,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:57,916 INFO L427 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:57,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:57,917 INFO L82 PathProgramCache]: Analyzing trace with hash -495697684, now seen corresponding path program 598 times [2020-02-10 20:14:57,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:57,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978302400] [2020-02-10 20:14:57,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:58,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978302400] [2020-02-10 20:14:58,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:58,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:58,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101980927] [2020-02-10 20:14:58,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:58,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:58,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:58,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:58,116 INFO L87 Difference]: Start difference. First operand 95 states and 238 transitions. Second operand 8 states. [2020-02-10 20:14:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:58,202 INFO L93 Difference]: Finished difference Result 130 states and 295 transitions. [2020-02-10 20:14:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:58,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:58,203 INFO L225 Difference]: With dead ends: 130 [2020-02-10 20:14:58,203 INFO L226 Difference]: Without dead ends: 115 [2020-02-10 20:14:58,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-02-10 20:14:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 93. [2020-02-10 20:14:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:14:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 233 transitions. [2020-02-10 20:14:58,206 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 233 transitions. Word has length 19 [2020-02-10 20:14:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:58,206 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 233 transitions. [2020-02-10 20:14:58,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 233 transitions. [2020-02-10 20:14:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:58,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:58,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:58,207 INFO L427 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1229468376, now seen corresponding path program 599 times [2020-02-10 20:14:58,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:58,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294910618] [2020-02-10 20:14:58,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:58,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294910618] [2020-02-10 20:14:58,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:58,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:58,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219523232] [2020-02-10 20:14:58,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:58,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:58,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:58,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:58,414 INFO L87 Difference]: Start difference. First operand 93 states and 233 transitions. Second operand 8 states. [2020-02-10 20:14:58,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:58,494 INFO L93 Difference]: Finished difference Result 123 states and 280 transitions. [2020-02-10 20:14:58,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:58,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:58,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:58,495 INFO L225 Difference]: With dead ends: 123 [2020-02-10 20:14:58,495 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 20:14:58,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 20:14:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2020-02-10 20:14:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:14:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 241 transitions. [2020-02-10 20:14:58,498 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 241 transitions. Word has length 19 [2020-02-10 20:14:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:58,498 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 241 transitions. [2020-02-10 20:14:58,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 241 transitions. [2020-02-10 20:14:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:58,499 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:58,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:58,499 INFO L427 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:58,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:58,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1985102680, now seen corresponding path program 600 times [2020-02-10 20:14:58,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:58,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038170838] [2020-02-10 20:14:58,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:58,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038170838] [2020-02-10 20:14:58,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:58,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:58,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150993670] [2020-02-10 20:14:58,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:58,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:58,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:58,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:58,705 INFO L87 Difference]: Start difference. First operand 97 states and 241 transitions. Second operand 8 states. [2020-02-10 20:14:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:58,786 INFO L93 Difference]: Finished difference Result 110 states and 259 transitions. [2020-02-10 20:14:58,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:58,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:58,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:58,787 INFO L225 Difference]: With dead ends: 110 [2020-02-10 20:14:58,787 INFO L226 Difference]: Without dead ends: 88 [2020-02-10 20:14:58,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-02-10 20:14:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-02-10 20:14:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:14:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 225 transitions. [2020-02-10 20:14:58,789 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 225 transitions. Word has length 19 [2020-02-10 20:14:58,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:58,789 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 225 transitions. [2020-02-10 20:14:58,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 225 transitions. [2020-02-10 20:14:58,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:58,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:58,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:58,790 INFO L427 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:58,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1155542588, now seen corresponding path program 601 times [2020-02-10 20:14:58,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:58,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488722761] [2020-02-10 20:14:58,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:58,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488722761] [2020-02-10 20:14:58,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:58,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:58,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563061592] [2020-02-10 20:14:58,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:58,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:58,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:58,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:58,978 INFO L87 Difference]: Start difference. First operand 88 states and 225 transitions. Second operand 8 states. [2020-02-10 20:14:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:59,057 INFO L93 Difference]: Finished difference Result 155 states and 325 transitions. [2020-02-10 20:14:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:59,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:59,058 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:14:59,059 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 20:14:59,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:59,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 20:14:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2020-02-10 20:14:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:14:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 231 transitions. [2020-02-10 20:14:59,061 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 231 transitions. Word has length 19 [2020-02-10 20:14:59,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:59,062 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 231 transitions. [2020-02-10 20:14:59,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 231 transitions. [2020-02-10 20:14:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:59,062 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:59,062 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:59,062 INFO L427 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:59,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:59,062 INFO L82 PathProgramCache]: Analyzing trace with hash 281207262, now seen corresponding path program 602 times [2020-02-10 20:14:59,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:59,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565577722] [2020-02-10 20:14:59,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:59,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565577722] [2020-02-10 20:14:59,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:59,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:59,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723979262] [2020-02-10 20:14:59,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:59,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:59,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:59,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:59,254 INFO L87 Difference]: Start difference. First operand 91 states and 231 transitions. Second operand 8 states. [2020-02-10 20:14:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:59,332 INFO L93 Difference]: Finished difference Result 151 states and 314 transitions. [2020-02-10 20:14:59,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:59,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:59,333 INFO L225 Difference]: With dead ends: 151 [2020-02-10 20:14:59,334 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:14:59,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:14:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-02-10 20:14:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:14:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 227 transitions. [2020-02-10 20:14:59,336 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 227 transitions. Word has length 19 [2020-02-10 20:14:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:59,337 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 227 transitions. [2020-02-10 20:14:59,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 227 transitions. [2020-02-10 20:14:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:59,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:59,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:59,337 INFO L427 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:59,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1978402594, now seen corresponding path program 603 times [2020-02-10 20:14:59,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:59,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300251989] [2020-02-10 20:14:59,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:59,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300251989] [2020-02-10 20:14:59,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:59,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:59,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776384692] [2020-02-10 20:14:59,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:59,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:59,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:59,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:59,529 INFO L87 Difference]: Start difference. First operand 89 states and 227 transitions. Second operand 8 states. [2020-02-10 20:14:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:59,607 INFO L93 Difference]: Finished difference Result 155 states and 324 transitions. [2020-02-10 20:14:59,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:59,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:59,608 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:14:59,609 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 20:14:59,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 20:14:59,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2020-02-10 20:14:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:14:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 230 transitions. [2020-02-10 20:14:59,611 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 230 transitions. Word has length 19 [2020-02-10 20:14:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:59,611 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 230 transitions. [2020-02-10 20:14:59,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 230 transitions. [2020-02-10 20:14:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:59,612 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:59,612 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:59,612 INFO L427 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:59,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:59,612 INFO L82 PathProgramCache]: Analyzing trace with hash -858272764, now seen corresponding path program 604 times [2020-02-10 20:14:59,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:59,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468748655] [2020-02-10 20:14:59,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:59,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468748655] [2020-02-10 20:14:59,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:59,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:14:59,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288686417] [2020-02-10 20:14:59,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:14:59,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:59,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:14:59,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:14:59,806 INFO L87 Difference]: Start difference. First operand 91 states and 230 transitions. Second operand 8 states. [2020-02-10 20:14:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:59,872 INFO L93 Difference]: Finished difference Result 151 states and 313 transitions. [2020-02-10 20:14:59,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:14:59,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:14:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:59,873 INFO L225 Difference]: With dead ends: 151 [2020-02-10 20:14:59,874 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:14:59,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:14:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:14:59,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-02-10 20:14:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:14:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 226 transitions. [2020-02-10 20:14:59,876 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 226 transitions. Word has length 19 [2020-02-10 20:14:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:59,876 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 226 transitions. [2020-02-10 20:14:59,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:14:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 226 transitions. [2020-02-10 20:14:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:14:59,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:59,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:59,877 INFO L427 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:59,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:59,877 INFO L82 PathProgramCache]: Analyzing trace with hash -80774848, now seen corresponding path program 605 times [2020-02-10 20:14:59,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:59,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070296113] [2020-02-10 20:14:59,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:00,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070296113] [2020-02-10 20:15:00,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:00,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:00,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104661195] [2020-02-10 20:15:00,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:00,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:00,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:00,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:00,073 INFO L87 Difference]: Start difference. First operand 89 states and 226 transitions. Second operand 8 states. [2020-02-10 20:15:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:00,149 INFO L93 Difference]: Finished difference Result 146 states and 302 transitions. [2020-02-10 20:15:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:00,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:00,149 INFO L225 Difference]: With dead ends: 146 [2020-02-10 20:15:00,150 INFO L226 Difference]: Without dead ends: 136 [2020-02-10 20:15:00,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:00,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-02-10 20:15:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 90. [2020-02-10 20:15:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:15:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 227 transitions. [2020-02-10 20:15:00,152 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 227 transitions. Word has length 19 [2020-02-10 20:15:00,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:00,152 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 227 transitions. [2020-02-10 20:15:00,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 227 transitions. [2020-02-10 20:15:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:00,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:00,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:00,153 INFO L427 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:00,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:00,153 INFO L82 PathProgramCache]: Analyzing trace with hash -320417186, now seen corresponding path program 606 times [2020-02-10 20:15:00,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:00,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381545150] [2020-02-10 20:15:00,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:00,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381545150] [2020-02-10 20:15:00,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:00,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:00,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743144743] [2020-02-10 20:15:00,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:00,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:00,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:00,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:00,359 INFO L87 Difference]: Start difference. First operand 90 states and 227 transitions. Second operand 8 states. [2020-02-10 20:15:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:00,422 INFO L93 Difference]: Finished difference Result 146 states and 301 transitions. [2020-02-10 20:15:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:00,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:00,423 INFO L225 Difference]: With dead ends: 146 [2020-02-10 20:15:00,423 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:15:00,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:15:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 88. [2020-02-10 20:15:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:15:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 224 transitions. [2020-02-10 20:15:00,425 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 224 transitions. Word has length 19 [2020-02-10 20:15:00,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:00,426 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 224 transitions. [2020-02-10 20:15:00,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 224 transitions. [2020-02-10 20:15:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:00,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:00,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:00,427 INFO L427 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:00,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:00,427 INFO L82 PathProgramCache]: Analyzing trace with hash -455398370, now seen corresponding path program 607 times [2020-02-10 20:15:00,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:00,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634437021] [2020-02-10 20:15:00,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:00,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634437021] [2020-02-10 20:15:00,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:00,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:00,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832418594] [2020-02-10 20:15:00,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:00,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:00,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:00,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:00,603 INFO L87 Difference]: Start difference. First operand 88 states and 224 transitions. Second operand 8 states. [2020-02-10 20:15:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:00,683 INFO L93 Difference]: Finished difference Result 161 states and 343 transitions. [2020-02-10 20:15:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:00,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:00,684 INFO L225 Difference]: With dead ends: 161 [2020-02-10 20:15:00,684 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 20:15:00,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 20:15:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 92. [2020-02-10 20:15:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:15:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-02-10 20:15:00,687 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-02-10 20:15:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:00,687 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-02-10 20:15:00,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-02-10 20:15:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:00,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:00,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:00,688 INFO L427 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:00,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1329733696, now seen corresponding path program 608 times [2020-02-10 20:15:00,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:00,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398513947] [2020-02-10 20:15:00,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:00,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398513947] [2020-02-10 20:15:00,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:00,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:00,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092083542] [2020-02-10 20:15:00,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:00,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:00,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:00,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:00,861 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-02-10 20:15:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:00,940 INFO L93 Difference]: Finished difference Result 157 states and 332 transitions. [2020-02-10 20:15:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:00,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:00,941 INFO L225 Difference]: With dead ends: 157 [2020-02-10 20:15:00,941 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:15:00,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:15:00,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-02-10 20:15:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:15:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 229 transitions. [2020-02-10 20:15:00,945 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 229 transitions. Word has length 19 [2020-02-10 20:15:00,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:00,945 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 229 transitions. [2020-02-10 20:15:00,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 229 transitions. [2020-02-10 20:15:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:00,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:00,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:00,946 INFO L427 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:00,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:00,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1034006626, now seen corresponding path program 609 times [2020-02-10 20:15:00,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:00,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790837686] [2020-02-10 20:15:00,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:01,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790837686] [2020-02-10 20:15:01,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:01,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:01,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213833346] [2020-02-10 20:15:01,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:01,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:01,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:01,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:01,138 INFO L87 Difference]: Start difference. First operand 90 states and 229 transitions. Second operand 8 states. [2020-02-10 20:15:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:01,218 INFO L93 Difference]: Finished difference Result 165 states and 353 transitions. [2020-02-10 20:15:01,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:01,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:01,222 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:15:01,222 INFO L226 Difference]: Without dead ends: 151 [2020-02-10 20:15:01,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-02-10 20:15:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 94. [2020-02-10 20:15:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:15:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-02-10 20:15:01,225 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-02-10 20:15:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:01,225 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-02-10 20:15:01,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-02-10 20:15:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:01,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:01,226 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:01,226 INFO L427 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:01,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:01,226 INFO L82 PathProgramCache]: Analyzing trace with hash 288709482, now seen corresponding path program 610 times [2020-02-10 20:15:01,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:01,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404516569] [2020-02-10 20:15:01,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:01,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404516569] [2020-02-10 20:15:01,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:01,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:01,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720480794] [2020-02-10 20:15:01,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:01,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:01,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:01,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:01,408 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-02-10 20:15:01,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:01,487 INFO L93 Difference]: Finished difference Result 163 states and 345 transitions. [2020-02-10 20:15:01,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:01,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:01,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:01,488 INFO L225 Difference]: With dead ends: 163 [2020-02-10 20:15:01,488 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 20:15:01,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 20:15:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 90. [2020-02-10 20:15:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:15:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 227 transitions. [2020-02-10 20:15:01,490 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 227 transitions. Word has length 19 [2020-02-10 20:15:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:01,490 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 227 transitions. [2020-02-10 20:15:01,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 227 transitions. [2020-02-10 20:15:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:01,491 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:01,491 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:01,491 INFO L427 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:01,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:01,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1901188502, now seen corresponding path program 611 times [2020-02-10 20:15:01,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:01,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505507418] [2020-02-10 20:15:01,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:01,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505507418] [2020-02-10 20:15:01,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:01,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:01,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462943571] [2020-02-10 20:15:01,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:01,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:01,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:01,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:01,684 INFO L87 Difference]: Start difference. First operand 90 states and 227 transitions. Second operand 8 states. [2020-02-10 20:15:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:01,764 INFO L93 Difference]: Finished difference Result 155 states and 326 transitions. [2020-02-10 20:15:01,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:01,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:01,765 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:15:01,765 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:15:01,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:15:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2020-02-10 20:15:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:15:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 230 transitions. [2020-02-10 20:15:01,768 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 230 transitions. Word has length 19 [2020-02-10 20:15:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:01,768 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 230 transitions. [2020-02-10 20:15:01,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 230 transitions. [2020-02-10 20:15:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:01,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:01,768 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:01,768 INFO L427 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:01,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:01,769 INFO L82 PathProgramCache]: Analyzing trace with hash -190575194, now seen corresponding path program 612 times [2020-02-10 20:15:01,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:01,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420946528] [2020-02-10 20:15:01,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:01,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420946528] [2020-02-10 20:15:01,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:01,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:01,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956377060] [2020-02-10 20:15:01,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:01,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:01,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:01,958 INFO L87 Difference]: Start difference. First operand 92 states and 230 transitions. Second operand 8 states. [2020-02-10 20:15:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:02,038 INFO L93 Difference]: Finished difference Result 157 states and 329 transitions. [2020-02-10 20:15:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:02,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:02,039 INFO L225 Difference]: With dead ends: 157 [2020-02-10 20:15:02,039 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 20:15:02,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 20:15:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2020-02-10 20:15:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:15:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 223 transitions. [2020-02-10 20:15:02,042 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 223 transitions. Word has length 19 [2020-02-10 20:15:02,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:02,042 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 223 transitions. [2020-02-10 20:15:02,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 223 transitions. [2020-02-10 20:15:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:02,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:02,043 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:02,043 INFO L427 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:02,043 INFO L82 PathProgramCache]: Analyzing trace with hash -884311006, now seen corresponding path program 613 times [2020-02-10 20:15:02,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:02,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898780671] [2020-02-10 20:15:02,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:02,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898780671] [2020-02-10 20:15:02,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:02,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:02,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250143740] [2020-02-10 20:15:02,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:02,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:02,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:02,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:02,218 INFO L87 Difference]: Start difference. First operand 88 states and 223 transitions. Second operand 8 states. [2020-02-10 20:15:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:02,294 INFO L93 Difference]: Finished difference Result 161 states and 342 transitions. [2020-02-10 20:15:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:02,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:02,295 INFO L225 Difference]: With dead ends: 161 [2020-02-10 20:15:02,295 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 20:15:02,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 20:15:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 92. [2020-02-10 20:15:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:15:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 233 transitions. [2020-02-10 20:15:02,298 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 233 transitions. Word has length 19 [2020-02-10 20:15:02,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:02,298 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 233 transitions. [2020-02-10 20:15:02,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:02,298 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 233 transitions. [2020-02-10 20:15:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:02,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:02,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:02,298 INFO L427 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:02,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:02,299 INFO L82 PathProgramCache]: Analyzing trace with hash 235818824, now seen corresponding path program 614 times [2020-02-10 20:15:02,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:02,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056595022] [2020-02-10 20:15:02,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:02,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056595022] [2020-02-10 20:15:02,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:02,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:02,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529429528] [2020-02-10 20:15:02,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:02,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:02,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:02,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:02,474 INFO L87 Difference]: Start difference. First operand 92 states and 233 transitions. Second operand 8 states. [2020-02-10 20:15:02,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:02,536 INFO L93 Difference]: Finished difference Result 157 states and 331 transitions. [2020-02-10 20:15:02,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:02,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:02,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:02,537 INFO L225 Difference]: With dead ends: 157 [2020-02-10 20:15:02,537 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:15:02,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:02,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:15:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-02-10 20:15:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:15:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 228 transitions. [2020-02-10 20:15:02,540 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 228 transitions. Word has length 19 [2020-02-10 20:15:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:02,540 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 228 transitions. [2020-02-10 20:15:02,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 228 transitions. [2020-02-10 20:15:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:02,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:02,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:02,540 INFO L427 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:02,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:02,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1629013504, now seen corresponding path program 615 times [2020-02-10 20:15:02,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:02,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641439111] [2020-02-10 20:15:02,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:02,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641439111] [2020-02-10 20:15:02,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:02,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:02,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356537286] [2020-02-10 20:15:02,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:02,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:02,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:02,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:02,717 INFO L87 Difference]: Start difference. First operand 90 states and 228 transitions. Second operand 8 states. [2020-02-10 20:15:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:02,787 INFO L93 Difference]: Finished difference Result 165 states and 352 transitions. [2020-02-10 20:15:02,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:02,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:02,787 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:15:02,788 INFO L226 Difference]: Without dead ends: 151 [2020-02-10 20:15:02,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:02,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-02-10 20:15:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 94. [2020-02-10 20:15:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:15:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 236 transitions. [2020-02-10 20:15:02,790 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 236 transitions. Word has length 19 [2020-02-10 20:15:02,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:02,791 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 236 transitions. [2020-02-10 20:15:02,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:02,791 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 236 transitions. [2020-02-10 20:15:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:02,791 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:02,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:02,791 INFO L427 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1920656648, now seen corresponding path program 616 times [2020-02-10 20:15:02,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:02,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77154480] [2020-02-10 20:15:02,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:02,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77154480] [2020-02-10 20:15:02,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:02,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:02,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756045181] [2020-02-10 20:15:02,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:02,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:02,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:02,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:02,963 INFO L87 Difference]: Start difference. First operand 94 states and 236 transitions. Second operand 8 states. [2020-02-10 20:15:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:03,043 INFO L93 Difference]: Finished difference Result 163 states and 344 transitions. [2020-02-10 20:15:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:03,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:03,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:03,044 INFO L225 Difference]: With dead ends: 163 [2020-02-10 20:15:03,044 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 20:15:03,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 20:15:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 90. [2020-02-10 20:15:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:15:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-02-10 20:15:03,047 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-02-10 20:15:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:03,047 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-02-10 20:15:03,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:03,047 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-02-10 20:15:03,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:03,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:03,048 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:03,048 INFO L427 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:03,048 INFO L82 PathProgramCache]: Analyzing trace with hash -299410978, now seen corresponding path program 617 times [2020-02-10 20:15:03,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:03,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537336747] [2020-02-10 20:15:03,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:03,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537336747] [2020-02-10 20:15:03,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:03,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:03,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120980410] [2020-02-10 20:15:03,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:03,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:03,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:03,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:03,233 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-02-10 20:15:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:03,293 INFO L93 Difference]: Finished difference Result 155 states and 325 transitions. [2020-02-10 20:15:03,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:03,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:03,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:03,294 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:15:03,294 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:15:03,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:03,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:15:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2020-02-10 20:15:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:15:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 229 transitions. [2020-02-10 20:15:03,297 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 229 transitions. Word has length 19 [2020-02-10 20:15:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:03,297 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 229 transitions. [2020-02-10 20:15:03,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 229 transitions. [2020-02-10 20:15:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:03,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:03,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:03,298 INFO L427 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:03,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:03,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1154717632, now seen corresponding path program 618 times [2020-02-10 20:15:03,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:03,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880008673] [2020-02-10 20:15:03,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:03,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:15:03,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880008673] [2020-02-10 20:15:03,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:03,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:03,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689910334] [2020-02-10 20:15:03,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:03,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:03,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:03,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:03,477 INFO L87 Difference]: Start difference. First operand 92 states and 229 transitions. Second operand 8 states. [2020-02-10 20:15:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:03,556 INFO L93 Difference]: Finished difference Result 157 states and 328 transitions. [2020-02-10 20:15:03,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:03,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:03,557 INFO L225 Difference]: With dead ends: 157 [2020-02-10 20:15:03,557 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 20:15:03,558 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 20:15:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2020-02-10 20:15:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:15:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 222 transitions. [2020-02-10 20:15:03,560 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 222 transitions. Word has length 19 [2020-02-10 20:15:03,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:03,560 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 222 transitions. [2020-02-10 20:15:03,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 222 transitions. [2020-02-10 20:15:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:03,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:03,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:03,561 INFO L427 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:03,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:03,562 INFO L82 PathProgramCache]: Analyzing trace with hash 506970474, now seen corresponding path program 619 times [2020-02-10 20:15:03,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:03,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006532509] [2020-02-10 20:15:03,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:03,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006532509] [2020-02-10 20:15:03,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:03,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:03,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619849631] [2020-02-10 20:15:03,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:03,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:03,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:03,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:03,764 INFO L87 Difference]: Start difference. First operand 88 states and 222 transitions. Second operand 8 states. [2020-02-10 20:15:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:03,832 INFO L93 Difference]: Finished difference Result 144 states and 297 transitions. [2020-02-10 20:15:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:03,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:03,833 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:15:03,833 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:15:03,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:03,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:15:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 90. [2020-02-10 20:15:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:15:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-02-10 20:15:03,836 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-02-10 20:15:03,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:03,836 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-02-10 20:15:03,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-02-10 20:15:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:03,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:03,837 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:03,837 INFO L427 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:03,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:03,838 INFO L82 PathProgramCache]: Analyzing trace with hash 267328136, now seen corresponding path program 620 times [2020-02-10 20:15:03,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:03,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163398626] [2020-02-10 20:15:03,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:04,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163398626] [2020-02-10 20:15:04,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:04,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:04,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327299540] [2020-02-10 20:15:04,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:04,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:04,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:04,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:04,048 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-02-10 20:15:04,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:04,105 INFO L93 Difference]: Finished difference Result 144 states and 296 transitions. [2020-02-10 20:15:04,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:04,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:04,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:04,106 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:15:04,106 INFO L226 Difference]: Without dead ends: 133 [2020-02-10 20:15:04,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-02-10 20:15:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 89. [2020-02-10 20:15:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:15:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 224 transitions. [2020-02-10 20:15:04,109 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 224 transitions. Word has length 19 [2020-02-10 20:15:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:04,109 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 224 transitions. [2020-02-10 20:15:04,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 224 transitions. [2020-02-10 20:15:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:04,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:04,109 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:04,110 INFO L427 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:04,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:04,110 INFO L82 PathProgramCache]: Analyzing trace with hash -237732024, now seen corresponding path program 621 times [2020-02-10 20:15:04,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:04,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738499374] [2020-02-10 20:15:04,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:04,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738499374] [2020-02-10 20:15:04,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:04,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:04,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139500534] [2020-02-10 20:15:04,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:04,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:04,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:04,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:04,312 INFO L87 Difference]: Start difference. First operand 89 states and 224 transitions. Second operand 8 states. [2020-02-10 20:15:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:04,389 INFO L93 Difference]: Finished difference Result 147 states and 304 transitions. [2020-02-10 20:15:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:04,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:04,390 INFO L225 Difference]: With dead ends: 147 [2020-02-10 20:15:04,390 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 20:15:04,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 20:15:04,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2020-02-10 20:15:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:15:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 227 transitions. [2020-02-10 20:15:04,393 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 227 transitions. Word has length 19 [2020-02-10 20:15:04,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:04,393 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 227 transitions. [2020-02-10 20:15:04,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 227 transitions. [2020-02-10 20:15:04,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:04,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:04,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:04,394 INFO L427 AbstractCegarLoop]: === Iteration 626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:04,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:04,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1472881284, now seen corresponding path program 622 times [2020-02-10 20:15:04,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:04,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068240233] [2020-02-10 20:15:04,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:04,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068240233] [2020-02-10 20:15:04,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:04,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:04,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009755879] [2020-02-10 20:15:04,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:04,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:04,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:04,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:04,589 INFO L87 Difference]: Start difference. First operand 91 states and 227 transitions. Second operand 8 states. [2020-02-10 20:15:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:04,667 INFO L93 Difference]: Finished difference Result 149 states and 307 transitions. [2020-02-10 20:15:04,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:04,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:04,668 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:15:04,668 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 20:15:04,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 20:15:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 89. [2020-02-10 20:15:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:15:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 223 transitions. [2020-02-10 20:15:04,671 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 223 transitions. Word has length 19 [2020-02-10 20:15:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:04,671 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 223 transitions. [2020-02-10 20:15:04,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 223 transitions. [2020-02-10 20:15:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:04,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:04,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:04,672 INFO L427 AbstractCegarLoop]: === Iteration 627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:04,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:04,672 INFO L82 PathProgramCache]: Analyzing trace with hash -805757244, now seen corresponding path program 623 times [2020-02-10 20:15:04,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:04,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92340701] [2020-02-10 20:15:04,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:04,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:15:04,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92340701] [2020-02-10 20:15:04,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:04,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:04,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562761531] [2020-02-10 20:15:04,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:04,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:04,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:04,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:04,879 INFO L87 Difference]: Start difference. First operand 89 states and 223 transitions. Second operand 8 states. [2020-02-10 20:15:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:04,938 INFO L93 Difference]: Finished difference Result 147 states and 303 transitions. [2020-02-10 20:15:04,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:04,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:04,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:04,939 INFO L225 Difference]: With dead ends: 147 [2020-02-10 20:15:04,939 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 20:15:04,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 20:15:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2020-02-10 20:15:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:15:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 226 transitions. [2020-02-10 20:15:04,942 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 226 transitions. Word has length 19 [2020-02-10 20:15:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:04,942 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 226 transitions. [2020-02-10 20:15:04,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 226 transitions. [2020-02-10 20:15:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:04,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:04,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:04,943 INFO L427 AbstractCegarLoop]: === Iteration 628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:04,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:04,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1661063898, now seen corresponding path program 624 times [2020-02-10 20:15:04,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:04,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918665499] [2020-02-10 20:15:04,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:05,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918665499] [2020-02-10 20:15:05,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:05,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:05,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975925252] [2020-02-10 20:15:05,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:05,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:05,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:05,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:05,139 INFO L87 Difference]: Start difference. First operand 91 states and 226 transitions. Second operand 8 states. [2020-02-10 20:15:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:05,213 INFO L93 Difference]: Finished difference Result 149 states and 306 transitions. [2020-02-10 20:15:05,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:05,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:05,214 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:15:05,214 INFO L226 Difference]: Without dead ends: 133 [2020-02-10 20:15:05,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-02-10 20:15:05,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 87. [2020-02-10 20:15:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:15:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 220 transitions. [2020-02-10 20:15:05,217 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 220 transitions. Word has length 19 [2020-02-10 20:15:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:05,217 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 220 transitions. [2020-02-10 20:15:05,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 220 transitions. [2020-02-10 20:15:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:05,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:05,218 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:05,218 INFO L427 AbstractCegarLoop]: === Iteration 629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:05,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1213390630, now seen corresponding path program 625 times [2020-02-10 20:15:05,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:05,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837740621] [2020-02-10 20:15:05,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:05,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837740621] [2020-02-10 20:15:05,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:05,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:05,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605186651] [2020-02-10 20:15:05,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:05,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:05,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:05,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:05,395 INFO L87 Difference]: Start difference. First operand 87 states and 220 transitions. Second operand 8 states. [2020-02-10 20:15:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:05,474 INFO L93 Difference]: Finished difference Result 153 states and 317 transitions. [2020-02-10 20:15:05,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:05,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:05,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:05,475 INFO L225 Difference]: With dead ends: 153 [2020-02-10 20:15:05,475 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:15:05,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:05,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:15:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-02-10 20:15:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:15:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 223 transitions. [2020-02-10 20:15:05,477 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 223 transitions. Word has length 19 [2020-02-10 20:15:05,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:05,478 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 223 transitions. [2020-02-10 20:15:05,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 223 transitions. [2020-02-10 20:15:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:05,478 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:05,478 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:05,478 INFO L427 AbstractCegarLoop]: === Iteration 630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:05,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:05,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2087725956, now seen corresponding path program 626 times [2020-02-10 20:15:05,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:05,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783618704] [2020-02-10 20:15:05,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:05,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783618704] [2020-02-10 20:15:05,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:05,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:05,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122286912] [2020-02-10 20:15:05,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:05,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:05,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:05,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:05,655 INFO L87 Difference]: Start difference. First operand 89 states and 223 transitions. Second operand 8 states. [2020-02-10 20:15:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:05,734 INFO L93 Difference]: Finished difference Result 149 states and 306 transitions. [2020-02-10 20:15:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:05,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:05,735 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:15:05,735 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 20:15:05,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 20:15:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 87. [2020-02-10 20:15:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:15:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 219 transitions. [2020-02-10 20:15:05,738 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 219 transitions. Word has length 19 [2020-02-10 20:15:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:05,738 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 219 transitions. [2020-02-10 20:15:05,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 219 transitions. [2020-02-10 20:15:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:05,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:05,739 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:05,739 INFO L427 AbstractCegarLoop]: === Iteration 631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:05,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:05,739 INFO L82 PathProgramCache]: Analyzing trace with hash -52368516, now seen corresponding path program 627 times [2020-02-10 20:15:05,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:05,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815347619] [2020-02-10 20:15:05,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:05,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815347619] [2020-02-10 20:15:05,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:05,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:05,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72134277] [2020-02-10 20:15:05,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:05,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:05,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:05,925 INFO L87 Difference]: Start difference. First operand 87 states and 219 transitions. Second operand 8 states. [2020-02-10 20:15:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:05,995 INFO L93 Difference]: Finished difference Result 153 states and 316 transitions. [2020-02-10 20:15:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:05,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:05,996 INFO L225 Difference]: With dead ends: 153 [2020-02-10 20:15:05,996 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:15:05,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:15:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-02-10 20:15:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:15:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 222 transitions. [2020-02-10 20:15:05,999 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 222 transitions. Word has length 19 [2020-02-10 20:15:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:05,999 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 222 transitions. [2020-02-10 20:15:05,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 222 transitions. [2020-02-10 20:15:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:05,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:05,999 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:05,999 INFO L427 AbstractCegarLoop]: === Iteration 632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:06,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1067761314, now seen corresponding path program 628 times [2020-02-10 20:15:06,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:06,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864508651] [2020-02-10 20:15:06,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:06,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864508651] [2020-02-10 20:15:06,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:06,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:06,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695812280] [2020-02-10 20:15:06,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:06,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:06,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:06,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:06,190 INFO L87 Difference]: Start difference. First operand 89 states and 222 transitions. Second operand 8 states. [2020-02-10 20:15:06,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:06,250 INFO L93 Difference]: Finished difference Result 149 states and 305 transitions. [2020-02-10 20:15:06,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:06,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:06,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:06,251 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:15:06,251 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 20:15:06,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:06,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 20:15:06,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 87. [2020-02-10 20:15:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:15:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 218 transitions. [2020-02-10 20:15:06,254 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 218 transitions. Word has length 19 [2020-02-10 20:15:06,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:06,254 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 218 transitions. [2020-02-10 20:15:06,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 218 transitions. [2020-02-10 20:15:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:06,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:06,255 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:06,255 INFO L427 AbstractCegarLoop]: === Iteration 633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:06,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:06,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1845259230, now seen corresponding path program 629 times [2020-02-10 20:15:06,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:06,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658865164] [2020-02-10 20:15:06,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:06,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658865164] [2020-02-10 20:15:06,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:06,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:06,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6752104] [2020-02-10 20:15:06,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:06,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:06,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:06,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:06,452 INFO L87 Difference]: Start difference. First operand 87 states and 218 transitions. Second operand 8 states. [2020-02-10 20:15:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:06,531 INFO L93 Difference]: Finished difference Result 144 states and 294 transitions. [2020-02-10 20:15:06,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:06,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:06,532 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:15:06,532 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:15:06,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:15:06,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 88. [2020-02-10 20:15:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:15:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 219 transitions. [2020-02-10 20:15:06,534 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 219 transitions. Word has length 19 [2020-02-10 20:15:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:06,534 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 219 transitions. [2020-02-10 20:15:06,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 219 transitions. [2020-02-10 20:15:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:06,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:06,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:06,534 INFO L427 AbstractCegarLoop]: === Iteration 634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:06,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:06,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1605616892, now seen corresponding path program 630 times [2020-02-10 20:15:06,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:06,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771505205] [2020-02-10 20:15:06,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:06,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771505205] [2020-02-10 20:15:06,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:06,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:06,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193535303] [2020-02-10 20:15:06,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:06,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:06,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:06,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:06,740 INFO L87 Difference]: Start difference. First operand 88 states and 219 transitions. Second operand 8 states. [2020-02-10 20:15:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:06,801 INFO L93 Difference]: Finished difference Result 144 states and 293 transitions. [2020-02-10 20:15:06,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:06,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:06,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:06,802 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:15:06,802 INFO L226 Difference]: Without dead ends: 132 [2020-02-10 20:15:06,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-02-10 20:15:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 86. [2020-02-10 20:15:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 20:15:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 216 transitions. [2020-02-10 20:15:06,805 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 216 transitions. Word has length 19 [2020-02-10 20:15:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:06,805 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 216 transitions. [2020-02-10 20:15:06,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 216 transitions. [2020-02-10 20:15:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:06,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:06,806 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:06,806 INFO L427 AbstractCegarLoop]: === Iteration 635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:06,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:06,806 INFO L82 PathProgramCache]: Analyzing trace with hash -119299042, now seen corresponding path program 631 times [2020-02-10 20:15:06,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:06,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156274257] [2020-02-10 20:15:06,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:06,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156274257] [2020-02-10 20:15:06,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:06,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:06,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054357523] [2020-02-10 20:15:06,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:06,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:06,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:06,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:06,980 INFO L87 Difference]: Start difference. First operand 86 states and 216 transitions. Second operand 8 states. [2020-02-10 20:15:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:07,058 INFO L93 Difference]: Finished difference Result 159 states and 335 transitions. [2020-02-10 20:15:07,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:07,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:07,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:07,059 INFO L225 Difference]: With dead ends: 159 [2020-02-10 20:15:07,060 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:15:07,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:07,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:15:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-02-10 20:15:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:15:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-02-10 20:15:07,062 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-02-10 20:15:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:07,063 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-02-10 20:15:07,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-02-10 20:15:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:07,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:07,063 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:07,063 INFO L427 AbstractCegarLoop]: === Iteration 636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:07,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:07,064 INFO L82 PathProgramCache]: Analyzing trace with hash -993634368, now seen corresponding path program 632 times [2020-02-10 20:15:07,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:07,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139793494] [2020-02-10 20:15:07,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:07,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139793494] [2020-02-10 20:15:07,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:07,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:07,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120318264] [2020-02-10 20:15:07,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:07,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:07,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:07,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:07,237 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-02-10 20:15:07,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:07,311 INFO L93 Difference]: Finished difference Result 155 states and 324 transitions. [2020-02-10 20:15:07,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:07,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:07,312 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:15:07,312 INFO L226 Difference]: Without dead ends: 143 [2020-02-10 20:15:07,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-02-10 20:15:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 88. [2020-02-10 20:15:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:15:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 221 transitions. [2020-02-10 20:15:07,315 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 221 transitions. Word has length 19 [2020-02-10 20:15:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:07,315 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 221 transitions. [2020-02-10 20:15:07,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:07,315 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 221 transitions. [2020-02-10 20:15:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:07,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:07,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:07,316 INFO L427 AbstractCegarLoop]: === Iteration 637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:07,316 INFO L82 PathProgramCache]: Analyzing trace with hash -579720990, now seen corresponding path program 633 times [2020-02-10 20:15:07,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:07,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877774477] [2020-02-10 20:15:07,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:07,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877774477] [2020-02-10 20:15:07,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:07,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:07,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609514998] [2020-02-10 20:15:07,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:07,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:07,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:07,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:07,493 INFO L87 Difference]: Start difference. First operand 88 states and 221 transitions. Second operand 8 states. [2020-02-10 20:15:07,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:07,572 INFO L93 Difference]: Finished difference Result 159 states and 338 transitions. [2020-02-10 20:15:07,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:07,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:07,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:07,573 INFO L225 Difference]: With dead ends: 159 [2020-02-10 20:15:07,573 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:15:07,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:07,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:15:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-02-10 20:15:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:15:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 231 transitions. [2020-02-10 20:15:07,576 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 231 transitions. Word has length 19 [2020-02-10 20:15:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:07,577 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 231 transitions. [2020-02-10 20:15:07,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 231 transitions. [2020-02-10 20:15:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:07,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:07,577 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:07,577 INFO L427 AbstractCegarLoop]: === Iteration 638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash 389163050, now seen corresponding path program 634 times [2020-02-10 20:15:07,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:07,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736060583] [2020-02-10 20:15:07,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:07,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736060583] [2020-02-10 20:15:07,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:07,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:07,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921003665] [2020-02-10 20:15:07,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:07,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:07,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:07,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:07,761 INFO L87 Difference]: Start difference. First operand 93 states and 231 transitions. Second operand 8 states. [2020-02-10 20:15:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:07,842 INFO L93 Difference]: Finished difference Result 149 states and 322 transitions. [2020-02-10 20:15:07,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:07,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:07,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:07,843 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:15:07,843 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 20:15:07,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 20:15:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2020-02-10 20:15:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:15:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 219 transitions. [2020-02-10 20:15:07,845 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 219 transitions. Word has length 19 [2020-02-10 20:15:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:07,846 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 219 transitions. [2020-02-10 20:15:07,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 219 transitions. [2020-02-10 20:15:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:07,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:07,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:07,846 INFO L427 AbstractCegarLoop]: === Iteration 639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:07,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:07,846 INFO L82 PathProgramCache]: Analyzing trace with hash 780051178, now seen corresponding path program 635 times [2020-02-10 20:15:07,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:07,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970796698] [2020-02-10 20:15:07,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:08,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970796698] [2020-02-10 20:15:08,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:08,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:08,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643875471] [2020-02-10 20:15:08,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:08,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:08,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:08,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:08,022 INFO L87 Difference]: Start difference. First operand 88 states and 219 transitions. Second operand 8 states. [2020-02-10 20:15:08,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:08,104 INFO L93 Difference]: Finished difference Result 152 states and 317 transitions. [2020-02-10 20:15:08,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:08,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:08,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:08,105 INFO L225 Difference]: With dead ends: 152 [2020-02-10 20:15:08,105 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 20:15:08,105 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 20:15:08,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 90. [2020-02-10 20:15:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:15:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 222 transitions. [2020-02-10 20:15:08,108 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 222 transitions. Word has length 19 [2020-02-10 20:15:08,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:08,108 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 222 transitions. [2020-02-10 20:15:08,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 222 transitions. [2020-02-10 20:15:08,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:08,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:08,109 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:08,109 INFO L427 AbstractCegarLoop]: === Iteration 640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:08,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:08,109 INFO L82 PathProgramCache]: Analyzing trace with hash -948996156, now seen corresponding path program 636 times [2020-02-10 20:15:08,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:08,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266808447] [2020-02-10 20:15:08,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:08,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266808447] [2020-02-10 20:15:08,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:08,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:08,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130814861] [2020-02-10 20:15:08,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:08,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:08,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:08,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:08,287 INFO L87 Difference]: Start difference. First operand 90 states and 222 transitions. Second operand 8 states. [2020-02-10 20:15:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:08,371 INFO L93 Difference]: Finished difference Result 146 states and 313 transitions. [2020-02-10 20:15:08,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:08,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:08,372 INFO L225 Difference]: With dead ends: 146 [2020-02-10 20:15:08,372 INFO L226 Difference]: Without dead ends: 129 [2020-02-10 20:15:08,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-02-10 20:15:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 86. [2020-02-10 20:15:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 20:15:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 215 transitions. [2020-02-10 20:15:08,377 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 215 transitions. Word has length 19 [2020-02-10 20:15:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:08,377 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 215 transitions. [2020-02-10 20:15:08,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 215 transitions. [2020-02-10 20:15:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:08,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:08,378 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:08,378 INFO L427 AbstractCegarLoop]: === Iteration 641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:08,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:08,378 INFO L82 PathProgramCache]: Analyzing trace with hash -558714782, now seen corresponding path program 637 times [2020-02-10 20:15:08,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:08,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258295538] [2020-02-10 20:15:08,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:08,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258295538] [2020-02-10 20:15:08,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:08,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:08,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024496327] [2020-02-10 20:15:08,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:08,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:08,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:08,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:08,563 INFO L87 Difference]: Start difference. First operand 86 states and 215 transitions. Second operand 8 states. [2020-02-10 20:15:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:08,641 INFO L93 Difference]: Finished difference Result 159 states and 334 transitions. [2020-02-10 20:15:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:08,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:08,642 INFO L225 Difference]: With dead ends: 159 [2020-02-10 20:15:08,642 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:15:08,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:15:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-02-10 20:15:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:15:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 225 transitions. [2020-02-10 20:15:08,645 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 225 transitions. Word has length 19 [2020-02-10 20:15:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:08,646 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 225 transitions. [2020-02-10 20:15:08,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 225 transitions. [2020-02-10 20:15:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:08,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:08,646 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:08,646 INFO L427 AbstractCegarLoop]: === Iteration 642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:08,647 INFO L82 PathProgramCache]: Analyzing trace with hash 561415048, now seen corresponding path program 638 times [2020-02-10 20:15:08,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:08,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654196088] [2020-02-10 20:15:08,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:08,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654196088] [2020-02-10 20:15:08,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:08,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:08,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114567895] [2020-02-10 20:15:08,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:08,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:08,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:08,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:08,834 INFO L87 Difference]: Start difference. First operand 90 states and 225 transitions. Second operand 8 states. [2020-02-10 20:15:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:08,887 INFO L93 Difference]: Finished difference Result 155 states and 323 transitions. [2020-02-10 20:15:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:08,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:08,888 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:15:08,889 INFO L226 Difference]: Without dead ends: 143 [2020-02-10 20:15:08,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:08,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-02-10 20:15:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 88. [2020-02-10 20:15:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:15:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 220 transitions. [2020-02-10 20:15:08,891 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 220 transitions. Word has length 19 [2020-02-10 20:15:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:08,891 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 220 transitions. [2020-02-10 20:15:08,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 220 transitions. [2020-02-10 20:15:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:08,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:08,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:08,892 INFO L427 AbstractCegarLoop]: === Iteration 643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:08,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:08,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1631800162, now seen corresponding path program 639 times [2020-02-10 20:15:08,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:08,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277797271] [2020-02-10 20:15:08,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:09,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:15:09,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277797271] [2020-02-10 20:15:09,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:09,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:09,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427025668] [2020-02-10 20:15:09,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:09,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:09,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:09,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:09,086 INFO L87 Difference]: Start difference. First operand 88 states and 220 transitions. Second operand 8 states. [2020-02-10 20:15:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:09,170 INFO L93 Difference]: Finished difference Result 159 states and 337 transitions. [2020-02-10 20:15:09,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:09,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:09,171 INFO L225 Difference]: With dead ends: 159 [2020-02-10 20:15:09,171 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:15:09,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:15:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-02-10 20:15:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:15:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 230 transitions. [2020-02-10 20:15:09,174 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 230 transitions. Word has length 19 [2020-02-10 20:15:09,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:09,174 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 230 transitions. [2020-02-10 20:15:09,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:09,174 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 230 transitions. [2020-02-10 20:15:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:09,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:09,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:09,175 INFO L427 AbstractCegarLoop]: === Iteration 644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:09,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:09,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2021110216, now seen corresponding path program 640 times [2020-02-10 20:15:09,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:09,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248601608] [2020-02-10 20:15:09,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:09,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248601608] [2020-02-10 20:15:09,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:09,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:09,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87452237] [2020-02-10 20:15:09,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:09,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:09,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:09,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:09,364 INFO L87 Difference]: Start difference. First operand 93 states and 230 transitions. Second operand 8 states. [2020-02-10 20:15:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:09,443 INFO L93 Difference]: Finished difference Result 149 states and 321 transitions. [2020-02-10 20:15:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:09,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:09,443 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:15:09,444 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 20:15:09,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:09,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 20:15:09,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2020-02-10 20:15:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:15:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 218 transitions. [2020-02-10 20:15:09,446 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 218 transitions. Word has length 19 [2020-02-10 20:15:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:09,446 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 218 transitions. [2020-02-10 20:15:09,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 218 transitions. [2020-02-10 20:15:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:09,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:09,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:09,447 INFO L427 AbstractCegarLoop]: === Iteration 645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:09,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:09,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1637126204, now seen corresponding path program 641 times [2020-02-10 20:15:09,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:09,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617847122] [2020-02-10 20:15:09,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:09,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617847122] [2020-02-10 20:15:09,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:09,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:09,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37055262] [2020-02-10 20:15:09,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:09,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:09,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:09,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:09,640 INFO L87 Difference]: Start difference. First operand 88 states and 218 transitions. Second operand 8 states. [2020-02-10 20:15:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:09,700 INFO L93 Difference]: Finished difference Result 152 states and 316 transitions. [2020-02-10 20:15:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:09,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:09,701 INFO L225 Difference]: With dead ends: 152 [2020-02-10 20:15:09,701 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 20:15:09,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 20:15:09,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 90. [2020-02-10 20:15:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:15:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 221 transitions. [2020-02-10 20:15:09,704 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 221 transitions. Word has length 19 [2020-02-10 20:15:09,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:09,704 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 221 transitions. [2020-02-10 20:15:09,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 221 transitions. [2020-02-10 20:15:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:09,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:09,705 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:09,705 INFO L427 AbstractCegarLoop]: === Iteration 646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:09,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:09,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1168436096, now seen corresponding path program 642 times [2020-02-10 20:15:09,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:09,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718814508] [2020-02-10 20:15:09,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:09,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718814508] [2020-02-10 20:15:09,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:09,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:09,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064672707] [2020-02-10 20:15:09,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:09,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:09,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:09,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:09,888 INFO L87 Difference]: Start difference. First operand 90 states and 221 transitions. Second operand 8 states. [2020-02-10 20:15:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:09,970 INFO L93 Difference]: Finished difference Result 146 states and 312 transitions. [2020-02-10 20:15:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:09,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:09,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:09,971 INFO L225 Difference]: With dead ends: 146 [2020-02-10 20:15:09,971 INFO L226 Difference]: Without dead ends: 129 [2020-02-10 20:15:09,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-02-10 20:15:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 86. [2020-02-10 20:15:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 20:15:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 214 transitions. [2020-02-10 20:15:09,973 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 214 transitions. Word has length 19 [2020-02-10 20:15:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:09,974 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 214 transitions. [2020-02-10 20:15:09,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 214 transitions. [2020-02-10 20:15:09,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:09,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:09,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:09,975 INFO L427 AbstractCegarLoop]: === Iteration 647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:09,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:09,975 INFO L82 PathProgramCache]: Analyzing trace with hash 832566698, now seen corresponding path program 643 times [2020-02-10 20:15:09,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:09,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209510930] [2020-02-10 20:15:09,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:10,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209510930] [2020-02-10 20:15:10,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:10,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:10,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513270389] [2020-02-10 20:15:10,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:10,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:10,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:10,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:10,172 INFO L87 Difference]: Start difference. First operand 86 states and 214 transitions. Second operand 8 states. [2020-02-10 20:15:10,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:10,246 INFO L93 Difference]: Finished difference Result 142 states and 289 transitions. [2020-02-10 20:15:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:10,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:10,247 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:15:10,248 INFO L226 Difference]: Without dead ends: 132 [2020-02-10 20:15:10,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-02-10 20:15:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 88. [2020-02-10 20:15:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:15:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 218 transitions. [2020-02-10 20:15:10,250 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 218 transitions. Word has length 19 [2020-02-10 20:15:10,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:10,251 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 218 transitions. [2020-02-10 20:15:10,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 218 transitions. [2020-02-10 20:15:10,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:10,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:10,251 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:10,251 INFO L427 AbstractCegarLoop]: === Iteration 648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:10,252 INFO L82 PathProgramCache]: Analyzing trace with hash 592924360, now seen corresponding path program 644 times [2020-02-10 20:15:10,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:10,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468997191] [2020-02-10 20:15:10,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:10,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468997191] [2020-02-10 20:15:10,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:10,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:10,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42628936] [2020-02-10 20:15:10,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:10,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:10,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:10,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:10,457 INFO L87 Difference]: Start difference. First operand 88 states and 218 transitions. Second operand 8 states. [2020-02-10 20:15:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:10,505 INFO L93 Difference]: Finished difference Result 142 states and 288 transitions. [2020-02-10 20:15:10,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:10,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:10,506 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:15:10,506 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 20:15:10,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 20:15:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 87. [2020-02-10 20:15:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:15:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 216 transitions. [2020-02-10 20:15:10,509 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 216 transitions. Word has length 19 [2020-02-10 20:15:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:10,509 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 216 transitions. [2020-02-10 20:15:10,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 216 transitions. [2020-02-10 20:15:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:10,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:10,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:10,510 INFO L427 AbstractCegarLoop]: === Iteration 649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:10,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:10,510 INFO L82 PathProgramCache]: Analyzing trace with hash -240518682, now seen corresponding path program 645 times [2020-02-10 20:15:10,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:10,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655358277] [2020-02-10 20:15:10,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:10,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655358277] [2020-02-10 20:15:10,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:10,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:10,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620793186] [2020-02-10 20:15:10,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:10,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:10,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:10,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:10,707 INFO L87 Difference]: Start difference. First operand 87 states and 216 transitions. Second operand 8 states. [2020-02-10 20:15:10,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:10,771 INFO L93 Difference]: Finished difference Result 144 states and 295 transitions. [2020-02-10 20:15:10,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:10,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:10,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:10,772 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:15:10,772 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:15:10,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:15:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2020-02-10 20:15:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:15:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 219 transitions. [2020-02-10 20:15:10,775 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 219 transitions. Word has length 19 [2020-02-10 20:15:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:10,775 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 219 transitions. [2020-02-10 20:15:10,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 219 transitions. [2020-02-10 20:15:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:10,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:10,776 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:10,776 INFO L427 AbstractCegarLoop]: === Iteration 650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:10,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:10,776 INFO L82 PathProgramCache]: Analyzing trace with hash 714460322, now seen corresponding path program 646 times [2020-02-10 20:15:10,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:10,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010800510] [2020-02-10 20:15:10,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:10,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010800510] [2020-02-10 20:15:10,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:10,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:10,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899749984] [2020-02-10 20:15:10,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:10,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:10,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:10,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:10,964 INFO L87 Difference]: Start difference. First operand 89 states and 219 transitions. Second operand 8 states. [2020-02-10 20:15:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:11,034 INFO L93 Difference]: Finished difference Result 138 states and 291 transitions. [2020-02-10 20:15:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:11,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:11,035 INFO L225 Difference]: With dead ends: 138 [2020-02-10 20:15:11,035 INFO L226 Difference]: Without dead ends: 123 [2020-02-10 20:15:11,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-02-10 20:15:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2020-02-10 20:15:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:15:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 215 transitions. [2020-02-10 20:15:11,038 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 215 transitions. Word has length 19 [2020-02-10 20:15:11,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:11,038 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 215 transitions. [2020-02-10 20:15:11,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 215 transitions. [2020-02-10 20:15:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:11,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:11,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:11,039 INFO L427 AbstractCegarLoop]: === Iteration 651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:11,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:11,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1130779938, now seen corresponding path program 647 times [2020-02-10 20:15:11,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:11,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018410067] [2020-02-10 20:15:11,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:11,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018410067] [2020-02-10 20:15:11,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:11,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:11,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251119899] [2020-02-10 20:15:11,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:11,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:11,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:11,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:11,240 INFO L87 Difference]: Start difference. First operand 87 states and 215 transitions. Second operand 8 states. [2020-02-10 20:15:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:11,287 INFO L93 Difference]: Finished difference Result 144 states and 294 transitions. [2020-02-10 20:15:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:11,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:11,288 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:15:11,288 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:15:11,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:15:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2020-02-10 20:15:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:15:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 218 transitions. [2020-02-10 20:15:11,291 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 218 transitions. Word has length 19 [2020-02-10 20:15:11,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:11,291 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 218 transitions. [2020-02-10 20:15:11,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 218 transitions. [2020-02-10 20:15:11,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:11,292 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:11,292 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:11,292 INFO L427 AbstractCegarLoop]: === Iteration 652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1674782362, now seen corresponding path program 648 times [2020-02-10 20:15:11,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:11,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427464790] [2020-02-10 20:15:11,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:11,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:15:11,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427464790] [2020-02-10 20:15:11,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:11,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:11,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399205986] [2020-02-10 20:15:11,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:11,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:11,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:11,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:11,477 INFO L87 Difference]: Start difference. First operand 89 states and 218 transitions. Second operand 8 states. [2020-02-10 20:15:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:11,545 INFO L93 Difference]: Finished difference Result 138 states and 290 transitions. [2020-02-10 20:15:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:11,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:11,546 INFO L225 Difference]: With dead ends: 138 [2020-02-10 20:15:11,546 INFO L226 Difference]: Without dead ends: 121 [2020-02-10 20:15:11,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-02-10 20:15:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2020-02-10 20:15:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:15:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 212 transitions. [2020-02-10 20:15:11,549 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 212 transitions. Word has length 19 [2020-02-10 20:15:11,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:11,549 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 212 transitions. [2020-02-10 20:15:11,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:11,549 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 212 transitions. [2020-02-10 20:15:11,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:11,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:11,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:11,550 INFO L427 AbstractCegarLoop]: === Iteration 653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:11,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:11,550 INFO L82 PathProgramCache]: Analyzing trace with hash -898297510, now seen corresponding path program 649 times [2020-02-10 20:15:11,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:11,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073313654] [2020-02-10 20:15:11,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:11,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073313654] [2020-02-10 20:15:11,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:11,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:11,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489718521] [2020-02-10 20:15:11,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:11,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:11,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:11,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:11,732 INFO L87 Difference]: Start difference. First operand 85 states and 212 transitions. Second operand 8 states. [2020-02-10 20:15:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:11,800 INFO L93 Difference]: Finished difference Result 154 states and 319 transitions. [2020-02-10 20:15:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:11,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:11,801 INFO L225 Difference]: With dead ends: 154 [2020-02-10 20:15:11,801 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 20:15:11,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 20:15:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 87. [2020-02-10 20:15:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:15:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 215 transitions. [2020-02-10 20:15:11,804 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 215 transitions. Word has length 19 [2020-02-10 20:15:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:11,804 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 215 transitions. [2020-02-10 20:15:11,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 215 transitions. [2020-02-10 20:15:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:11,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:11,805 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:11,805 INFO L427 AbstractCegarLoop]: === Iteration 654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:11,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:11,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1772632836, now seen corresponding path program 650 times [2020-02-10 20:15:11,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:11,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132515185] [2020-02-10 20:15:11,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:11,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:15:11,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132515185] [2020-02-10 20:15:11,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:11,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:11,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183659481] [2020-02-10 20:15:11,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:11,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:11,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:11,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:11,989 INFO L87 Difference]: Start difference. First operand 87 states and 215 transitions. Second operand 8 states. [2020-02-10 20:15:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:12,058 INFO L93 Difference]: Finished difference Result 150 states and 308 transitions. [2020-02-10 20:15:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:12,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:12,059 INFO L225 Difference]: With dead ends: 150 [2020-02-10 20:15:12,059 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 20:15:12,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 20:15:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 85. [2020-02-10 20:15:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:15:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 210 transitions. [2020-02-10 20:15:12,061 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 210 transitions. Word has length 19 [2020-02-10 20:15:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:12,062 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 210 transitions. [2020-02-10 20:15:12,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 210 transitions. [2020-02-10 20:15:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:12,062 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:12,062 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:12,062 INFO L427 AbstractCegarLoop]: === Iteration 655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:12,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:12,063 INFO L82 PathProgramCache]: Analyzing trace with hash 591107486, now seen corresponding path program 651 times [2020-02-10 20:15:12,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:12,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520423832] [2020-02-10 20:15:12,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:12,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520423832] [2020-02-10 20:15:12,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:12,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:12,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588979314] [2020-02-10 20:15:12,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:12,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:12,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:12,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:12,234 INFO L87 Difference]: Start difference. First operand 85 states and 210 transitions. Second operand 8 states. [2020-02-10 20:15:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:12,299 INFO L93 Difference]: Finished difference Result 158 states and 329 transitions. [2020-02-10 20:15:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:12,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:12,300 INFO L225 Difference]: With dead ends: 158 [2020-02-10 20:15:12,301 INFO L226 Difference]: Without dead ends: 144 [2020-02-10 20:15:12,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-02-10 20:15:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 89. [2020-02-10 20:15:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:15:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 218 transitions. [2020-02-10 20:15:12,303 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 218 transitions. Word has length 19 [2020-02-10 20:15:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:12,304 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 218 transitions. [2020-02-10 20:15:12,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 218 transitions. [2020-02-10 20:15:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:12,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:12,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:12,304 INFO L427 AbstractCegarLoop]: === Iteration 656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:12,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:12,304 INFO L82 PathProgramCache]: Analyzing trace with hash -154189658, now seen corresponding path program 652 times [2020-02-10 20:15:12,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:12,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072377166] [2020-02-10 20:15:12,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:12,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072377166] [2020-02-10 20:15:12,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:12,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:12,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636355943] [2020-02-10 20:15:12,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:12,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:12,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:12,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:12,479 INFO L87 Difference]: Start difference. First operand 89 states and 218 transitions. Second operand 8 states. [2020-02-10 20:15:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:12,547 INFO L93 Difference]: Finished difference Result 156 states and 321 transitions. [2020-02-10 20:15:12,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:12,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:12,548 INFO L225 Difference]: With dead ends: 156 [2020-02-10 20:15:12,548 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 20:15:12,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:12,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 20:15:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 85. [2020-02-10 20:15:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:15:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 208 transitions. [2020-02-10 20:15:12,551 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 208 transitions. Word has length 19 [2020-02-10 20:15:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:12,551 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 208 transitions. [2020-02-10 20:15:12,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 208 transitions. [2020-02-10 20:15:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:12,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:12,552 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:12,552 INFO L427 AbstractCegarLoop]: === Iteration 657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:12,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:12,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1950879654, now seen corresponding path program 653 times [2020-02-10 20:15:12,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:12,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629139909] [2020-02-10 20:15:12,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:12,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629139909] [2020-02-10 20:15:12,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:12,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:12,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451326808] [2020-02-10 20:15:12,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:12,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:12,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:12,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:12,729 INFO L87 Difference]: Start difference. First operand 85 states and 208 transitions. Second operand 8 states. [2020-02-10 20:15:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:12,792 INFO L93 Difference]: Finished difference Result 148 states and 302 transitions. [2020-02-10 20:15:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:12,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:12,793 INFO L225 Difference]: With dead ends: 148 [2020-02-10 20:15:12,793 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 20:15:12,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 20:15:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 87. [2020-02-10 20:15:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:15:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 211 transitions. [2020-02-10 20:15:12,795 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 211 transitions. Word has length 19 [2020-02-10 20:15:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:12,795 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 211 transitions. [2020-02-10 20:15:12,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 211 transitions. [2020-02-10 20:15:12,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:12,796 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:12,796 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:12,796 INFO L427 AbstractCegarLoop]: === Iteration 658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:12,796 INFO L82 PathProgramCache]: Analyzing trace with hash -633474334, now seen corresponding path program 654 times [2020-02-10 20:15:12,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:12,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157179182] [2020-02-10 20:15:12,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:12,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157179182] [2020-02-10 20:15:12,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:12,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:12,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769560267] [2020-02-10 20:15:12,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:12,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:12,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:12,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:12,974 INFO L87 Difference]: Start difference. First operand 87 states and 211 transitions. Second operand 8 states. [2020-02-10 20:15:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:13,040 INFO L93 Difference]: Finished difference Result 150 states and 305 transitions. [2020-02-10 20:15:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:13,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:13,041 INFO L225 Difference]: With dead ends: 150 [2020-02-10 20:15:13,041 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:15:13,041 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:15:13,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 83. [2020-02-10 20:15:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:15:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 203 transitions. [2020-02-10 20:15:13,044 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 203 transitions. Word has length 19 [2020-02-10 20:15:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:13,044 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 203 transitions. [2020-02-10 20:15:13,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 203 transitions. [2020-02-10 20:15:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:13,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:13,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:13,045 INFO L427 AbstractCegarLoop]: === Iteration 659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:13,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:13,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1213390630, now seen corresponding path program 655 times [2020-02-10 20:15:13,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:13,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656425992] [2020-02-10 20:15:13,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:13,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656425992] [2020-02-10 20:15:13,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:13,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:13,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657826763] [2020-02-10 20:15:13,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:13,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:13,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:13,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:13,214 INFO L87 Difference]: Start difference. First operand 83 states and 203 transitions. Second operand 8 states. [2020-02-10 20:15:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:13,280 INFO L93 Difference]: Finished difference Result 152 states and 310 transitions. [2020-02-10 20:15:13,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:13,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:13,281 INFO L225 Difference]: With dead ends: 152 [2020-02-10 20:15:13,282 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 20:15:13,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 20:15:13,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2020-02-10 20:15:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:15:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 201 transitions. [2020-02-10 20:15:13,284 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 201 transitions. Word has length 19 [2020-02-10 20:15:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:13,284 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 201 transitions. [2020-02-10 20:15:13,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:13,284 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 201 transitions. [2020-02-10 20:15:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:13,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:13,284 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:13,285 INFO L427 AbstractCegarLoop]: === Iteration 660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:13,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2087725956, now seen corresponding path program 656 times [2020-02-10 20:15:13,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:13,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280143971] [2020-02-10 20:15:13,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:13,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280143971] [2020-02-10 20:15:13,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:13,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:13,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878341168] [2020-02-10 20:15:13,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:13,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:13,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:13,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:13,455 INFO L87 Difference]: Start difference. First operand 83 states and 201 transitions. Second operand 8 states. [2020-02-10 20:15:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:13,523 INFO L93 Difference]: Finished difference Result 148 states and 299 transitions. [2020-02-10 20:15:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:13,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:13,524 INFO L225 Difference]: With dead ends: 148 [2020-02-10 20:15:13,525 INFO L226 Difference]: Without dead ends: 136 [2020-02-10 20:15:13,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-02-10 20:15:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2020-02-10 20:15:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:15:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 196 transitions. [2020-02-10 20:15:13,527 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 196 transitions. Word has length 19 [2020-02-10 20:15:13,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:13,527 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 196 transitions. [2020-02-10 20:15:13,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 196 transitions. [2020-02-10 20:15:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:13,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:13,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:13,528 INFO L427 AbstractCegarLoop]: === Iteration 661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:13,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:13,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1020716864, now seen corresponding path program 657 times [2020-02-10 20:15:13,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:13,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827485658] [2020-02-10 20:15:13,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:13,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827485658] [2020-02-10 20:15:13,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:13,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:13,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511623678] [2020-02-10 20:15:13,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:13,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:13,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:13,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:13,712 INFO L87 Difference]: Start difference. First operand 81 states and 196 transitions. Second operand 8 states. [2020-02-10 20:15:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:13,777 INFO L93 Difference]: Finished difference Result 152 states and 313 transitions. [2020-02-10 20:15:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:13,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:13,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:13,781 INFO L225 Difference]: With dead ends: 152 [2020-02-10 20:15:13,781 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 20:15:13,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 20:15:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 86. [2020-02-10 20:15:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 20:15:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 206 transitions. [2020-02-10 20:15:13,783 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 206 transitions. Word has length 19 [2020-02-10 20:15:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:13,783 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 206 transitions. [2020-02-10 20:15:13,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 206 transitions. [2020-02-10 20:15:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:13,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:13,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:13,784 INFO L427 AbstractCegarLoop]: === Iteration 662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:13,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:13,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1989600904, now seen corresponding path program 658 times [2020-02-10 20:15:13,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:13,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270923705] [2020-02-10 20:15:13,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:13,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:15:13,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270923705] [2020-02-10 20:15:13,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:13,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:13,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041847666] [2020-02-10 20:15:13,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:13,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:13,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:13,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:13,960 INFO L87 Difference]: Start difference. First operand 86 states and 206 transitions. Second operand 8 states. [2020-02-10 20:15:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:14,027 INFO L93 Difference]: Finished difference Result 142 states and 297 transitions. [2020-02-10 20:15:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:14,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:14,028 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:15:14,028 INFO L226 Difference]: Without dead ends: 124 [2020-02-10 20:15:14,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-02-10 20:15:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 81. [2020-02-10 20:15:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:15:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 194 transitions. [2020-02-10 20:15:14,031 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 194 transitions. Word has length 19 [2020-02-10 20:15:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:14,031 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 194 transitions. [2020-02-10 20:15:14,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 194 transitions. [2020-02-10 20:15:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:14,031 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:14,031 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:14,031 INFO L427 AbstractCegarLoop]: === Iteration 663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:14,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:14,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1914478264, now seen corresponding path program 659 times [2020-02-10 20:15:14,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:14,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92421832] [2020-02-10 20:15:14,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:14,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92421832] [2020-02-10 20:15:14,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:14,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:14,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25796446] [2020-02-10 20:15:14,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:14,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:14,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:14,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:14,204 INFO L87 Difference]: Start difference. First operand 81 states and 194 transitions. Second operand 8 states. [2020-02-10 20:15:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:14,274 INFO L93 Difference]: Finished difference Result 145 states and 292 transitions. [2020-02-10 20:15:14,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:14,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:14,275 INFO L225 Difference]: With dead ends: 145 [2020-02-10 20:15:14,275 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 20:15:14,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 20:15:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2020-02-10 20:15:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:15:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-02-10 20:15:14,277 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-02-10 20:15:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:14,277 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-02-10 20:15:14,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-02-10 20:15:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:14,278 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:14,278 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:14,278 INFO L427 AbstractCegarLoop]: === Iteration 664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash 651441698, now seen corresponding path program 660 times [2020-02-10 20:15:14,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:14,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933543197] [2020-02-10 20:15:14,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:14,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933543197] [2020-02-10 20:15:14,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:14,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:14,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834503699] [2020-02-10 20:15:14,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:14,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:14,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:14,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:14,448 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-02-10 20:15:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:14,515 INFO L93 Difference]: Finished difference Result 139 states and 288 transitions. [2020-02-10 20:15:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:14,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:14,516 INFO L225 Difference]: With dead ends: 139 [2020-02-10 20:15:14,516 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 20:15:14,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 20:15:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2020-02-10 20:15:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:15:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 189 transitions. [2020-02-10 20:15:14,518 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 189 transitions. Word has length 19 [2020-02-10 20:15:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:14,518 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 189 transitions. [2020-02-10 20:15:14,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 189 transitions. [2020-02-10 20:15:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:14,519 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:14,519 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:14,519 INFO L427 AbstractCegarLoop]: === Iteration 665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:14,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:14,519 INFO L82 PathProgramCache]: Analyzing trace with hash -797071014, now seen corresponding path program 661 times [2020-02-10 20:15:14,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:14,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734818838] [2020-02-10 20:15:14,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:14,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734818838] [2020-02-10 20:15:14,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:14,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:14,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240098408] [2020-02-10 20:15:14,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:14,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:14,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:14,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:14,708 INFO L87 Difference]: Start difference. First operand 79 states and 189 transitions. Second operand 8 states. [2020-02-10 20:15:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:14,773 INFO L93 Difference]: Finished difference Result 156 states and 329 transitions. [2020-02-10 20:15:14,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:14,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:14,774 INFO L225 Difference]: With dead ends: 156 [2020-02-10 20:15:14,774 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 20:15:14,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:14,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 20:15:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2020-02-10 20:15:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:15:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 213 transitions. [2020-02-10 20:15:14,776 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 213 transitions. Word has length 19 [2020-02-10 20:15:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:14,776 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 213 transitions. [2020-02-10 20:15:14,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 213 transitions. [2020-02-10 20:15:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:14,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:14,777 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:14,777 INFO L427 AbstractCegarLoop]: === Iteration 666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1542368158, now seen corresponding path program 662 times [2020-02-10 20:15:14,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:14,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983661220] [2020-02-10 20:15:14,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:14,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983661220] [2020-02-10 20:15:14,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:14,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:14,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627977273] [2020-02-10 20:15:14,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:14,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:14,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:14,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:14,966 INFO L87 Difference]: Start difference. First operand 87 states and 213 transitions. Second operand 8 states. [2020-02-10 20:15:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:15,033 INFO L93 Difference]: Finished difference Result 154 states and 321 transitions. [2020-02-10 20:15:15,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:15,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:15,034 INFO L225 Difference]: With dead ends: 154 [2020-02-10 20:15:15,034 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 20:15:15,034 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:15,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 20:15:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2020-02-10 20:15:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:15:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 201 transitions. [2020-02-10 20:15:15,036 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 201 transitions. Word has length 19 [2020-02-10 20:15:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:15,036 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 201 transitions. [2020-02-10 20:15:15,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 201 transitions. [2020-02-10 20:15:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:15,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:15,037 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:15,037 INFO L427 AbstractCegarLoop]: === Iteration 667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash -52368516, now seen corresponding path program 663 times [2020-02-10 20:15:15,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:15,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679227936] [2020-02-10 20:15:15,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:15,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:15:15,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679227936] [2020-02-10 20:15:15,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:15,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:15,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553291029] [2020-02-10 20:15:15,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:15,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:15,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:15,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:15,227 INFO L87 Difference]: Start difference. First operand 83 states and 201 transitions. Second operand 8 states. [2020-02-10 20:15:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:15,293 INFO L93 Difference]: Finished difference Result 147 states and 303 transitions. [2020-02-10 20:15:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:15,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:15,294 INFO L225 Difference]: With dead ends: 147 [2020-02-10 20:15:15,294 INFO L226 Difference]: Without dead ends: 133 [2020-02-10 20:15:15,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-02-10 20:15:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2020-02-10 20:15:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:15:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 211 transitions. [2020-02-10 20:15:15,297 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 211 transitions. Word has length 19 [2020-02-10 20:15:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:15,297 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 211 transitions. [2020-02-10 20:15:15,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 211 transitions. [2020-02-10 20:15:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:15,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:15,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:15,298 INFO L427 AbstractCegarLoop]: === Iteration 668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:15,298 INFO L82 PathProgramCache]: Analyzing trace with hash 916515524, now seen corresponding path program 664 times [2020-02-10 20:15:15,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:15,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220827070] [2020-02-10 20:15:15,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:15,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220827070] [2020-02-10 20:15:15,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:15,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:15,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933951210] [2020-02-10 20:15:15,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:15,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:15,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:15,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:15,489 INFO L87 Difference]: Start difference. First operand 88 states and 211 transitions. Second operand 8 states. [2020-02-10 20:15:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:15,556 INFO L93 Difference]: Finished difference Result 137 states and 287 transitions. [2020-02-10 20:15:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:15,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:15,557 INFO L225 Difference]: With dead ends: 137 [2020-02-10 20:15:15,557 INFO L226 Difference]: Without dead ends: 119 [2020-02-10 20:15:15,558 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-02-10 20:15:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 83. [2020-02-10 20:15:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:15:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-02-10 20:15:15,560 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-02-10 20:15:15,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:15,560 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-02-10 20:15:15,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-02-10 20:15:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:15,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:15,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:15,561 INFO L427 AbstractCegarLoop]: === Iteration 669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:15,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:15,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1571733990, now seen corresponding path program 665 times [2020-02-10 20:15:15,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:15,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877277685] [2020-02-10 20:15:15,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:15,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877277685] [2020-02-10 20:15:15,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:15,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:15,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348394370] [2020-02-10 20:15:15,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:15,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:15,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:15,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:15,752 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-02-10 20:15:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:15,816 INFO L93 Difference]: Finished difference Result 135 states and 283 transitions. [2020-02-10 20:15:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:15,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:15,817 INFO L225 Difference]: With dead ends: 135 [2020-02-10 20:15:15,817 INFO L226 Difference]: Without dead ends: 123 [2020-02-10 20:15:15,818 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:15,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-02-10 20:15:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2020-02-10 20:15:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:15:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 205 transitions. [2020-02-10 20:15:15,820 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 205 transitions. Word has length 19 [2020-02-10 20:15:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:15,820 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 205 transitions. [2020-02-10 20:15:15,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 205 transitions. [2020-02-10 20:15:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:15,821 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:15,821 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:15,821 INFO L427 AbstractCegarLoop]: === Iteration 670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:15,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash -712859460, now seen corresponding path program 666 times [2020-02-10 20:15:15,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:15,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627350905] [2020-02-10 20:15:15,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:16,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627350905] [2020-02-10 20:15:16,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:16,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:16,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588026981] [2020-02-10 20:15:16,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:16,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:16,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:16,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:16,011 INFO L87 Difference]: Start difference. First operand 87 states and 205 transitions. Second operand 8 states. [2020-02-10 20:15:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:16,078 INFO L93 Difference]: Finished difference Result 122 states and 262 transitions. [2020-02-10 20:15:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:16,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:16,079 INFO L225 Difference]: With dead ends: 122 [2020-02-10 20:15:16,079 INFO L226 Difference]: Without dead ends: 101 [2020-02-10 20:15:16,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:16,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-02-10 20:15:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2020-02-10 20:15:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:15:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 187 transitions. [2020-02-10 20:15:16,082 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 187 transitions. Word has length 19 [2020-02-10 20:15:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:16,082 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 187 transitions. [2020-02-10 20:15:16,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 187 transitions. [2020-02-10 20:15:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:16,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:16,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:16,082 INFO L427 AbstractCegarLoop]: === Iteration 671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:16,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1100556732, now seen corresponding path program 667 times [2020-02-10 20:15:16,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:16,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545927254] [2020-02-10 20:15:16,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:16,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545927254] [2020-02-10 20:15:16,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:16,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:16,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134993713] [2020-02-10 20:15:16,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:16,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:16,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:16,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:16,276 INFO L87 Difference]: Start difference. First operand 79 states and 187 transitions. Second operand 8 states. [2020-02-10 20:15:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:16,342 INFO L93 Difference]: Finished difference Result 141 states and 283 transitions. [2020-02-10 20:15:16,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:16,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:16,343 INFO L225 Difference]: With dead ends: 141 [2020-02-10 20:15:16,343 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 20:15:16,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 20:15:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 83. [2020-02-10 20:15:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:15:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-02-10 20:15:16,345 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-02-10 20:15:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:16,345 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-02-10 20:15:16,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-02-10 20:15:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:16,345 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:16,346 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:16,346 INFO L427 AbstractCegarLoop]: === Iteration 672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:16,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:16,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1483797256, now seen corresponding path program 668 times [2020-02-10 20:15:16,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:16,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153694478] [2020-02-10 20:15:16,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:16,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153694478] [2020-02-10 20:15:16,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:16,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:16,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396689641] [2020-02-10 20:15:16,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:16,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:16,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:16,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:16,542 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-02-10 20:15:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:16,609 INFO L93 Difference]: Finished difference Result 143 states and 286 transitions. [2020-02-10 20:15:16,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:16,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:16,609 INFO L225 Difference]: With dead ends: 143 [2020-02-10 20:15:16,610 INFO L226 Difference]: Without dead ends: 129 [2020-02-10 20:15:16,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-02-10 20:15:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 81. [2020-02-10 20:15:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:15:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 192 transitions. [2020-02-10 20:15:16,612 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 192 transitions. Word has length 19 [2020-02-10 20:15:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:16,612 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 192 transitions. [2020-02-10 20:15:16,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 192 transitions. [2020-02-10 20:15:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:16,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:16,613 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:16,614 INFO L427 AbstractCegarLoop]: === Iteration 673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:16,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:16,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1845259230, now seen corresponding path program 669 times [2020-02-10 20:15:16,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:16,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316350190] [2020-02-10 20:15:16,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:16,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316350190] [2020-02-10 20:15:16,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:16,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:16,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753269617] [2020-02-10 20:15:16,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:16,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:16,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:16,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:16,804 INFO L87 Difference]: Start difference. First operand 81 states and 192 transitions. Second operand 8 states. [2020-02-10 20:15:16,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:16,869 INFO L93 Difference]: Finished difference Result 138 states and 275 transitions. [2020-02-10 20:15:16,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:16,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:16,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:16,870 INFO L225 Difference]: With dead ends: 138 [2020-02-10 20:15:16,870 INFO L226 Difference]: Without dead ends: 128 [2020-02-10 20:15:16,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-02-10 20:15:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 83. [2020-02-10 20:15:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:15:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 195 transitions. [2020-02-10 20:15:16,873 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 195 transitions. Word has length 19 [2020-02-10 20:15:16,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:16,873 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 195 transitions. [2020-02-10 20:15:16,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 195 transitions. [2020-02-10 20:15:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:16,873 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:16,873 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:16,873 INFO L427 AbstractCegarLoop]: === Iteration 674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash 116211896, now seen corresponding path program 670 times [2020-02-10 20:15:16,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:16,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066493498] [2020-02-10 20:15:16,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:17,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066493498] [2020-02-10 20:15:17,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:17,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:17,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604295737] [2020-02-10 20:15:17,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:17,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:17,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:17,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:17,071 INFO L87 Difference]: Start difference. First operand 83 states and 195 transitions. Second operand 8 states. [2020-02-10 20:15:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:17,144 INFO L93 Difference]: Finished difference Result 132 states and 271 transitions. [2020-02-10 20:15:17,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:17,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:17,145 INFO L225 Difference]: With dead ends: 132 [2020-02-10 20:15:17,145 INFO L226 Difference]: Without dead ends: 117 [2020-02-10 20:15:17,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-02-10 20:15:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2020-02-10 20:15:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:15:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 190 transitions. [2020-02-10 20:15:17,148 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 190 transitions. Word has length 19 [2020-02-10 20:15:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:17,148 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 190 transitions. [2020-02-10 20:15:17,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 190 transitions. [2020-02-10 20:15:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:17,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:17,148 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:17,148 INFO L427 AbstractCegarLoop]: === Iteration 675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:17,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:17,149 INFO L82 PathProgramCache]: Analyzing trace with hash 750310238, now seen corresponding path program 671 times [2020-02-10 20:15:17,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:17,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157659043] [2020-02-10 20:15:17,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:17,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:15:17,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157659043] [2020-02-10 20:15:17,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:17,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:17,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478485746] [2020-02-10 20:15:17,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:17,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:17,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:17,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:17,340 INFO L87 Difference]: Start difference. First operand 81 states and 190 transitions. Second operand 8 states. [2020-02-10 20:15:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:17,409 INFO L93 Difference]: Finished difference Result 133 states and 276 transitions. [2020-02-10 20:15:17,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:17,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:17,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:17,410 INFO L225 Difference]: With dead ends: 133 [2020-02-10 20:15:17,410 INFO L226 Difference]: Without dead ends: 121 [2020-02-10 20:15:17,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:17,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-02-10 20:15:17,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2020-02-10 20:15:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:15:17,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 198 transitions. [2020-02-10 20:15:17,412 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 198 transitions. Word has length 19 [2020-02-10 20:15:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:17,413 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 198 transitions. [2020-02-10 20:15:17,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:17,413 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 198 transitions. [2020-02-10 20:15:17,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:17,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:17,413 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:17,413 INFO L427 AbstractCegarLoop]: === Iteration 676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:17,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:17,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1605616892, now seen corresponding path program 672 times [2020-02-10 20:15:17,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:17,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423108670] [2020-02-10 20:15:17,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:17,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:15:17,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423108670] [2020-02-10 20:15:17,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:17,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:17,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810935144] [2020-02-10 20:15:17,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:17,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:17,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:17,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:17,610 INFO L87 Difference]: Start difference. First operand 85 states and 198 transitions. Second operand 8 states. [2020-02-10 20:15:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:17,674 INFO L93 Difference]: Finished difference Result 120 states and 255 transitions. [2020-02-10 20:15:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:17,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:17,675 INFO L225 Difference]: With dead ends: 120 [2020-02-10 20:15:17,675 INFO L226 Difference]: Without dead ends: 99 [2020-02-10 20:15:17,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-02-10 20:15:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2020-02-10 20:15:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 20:15:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 183 transitions. [2020-02-10 20:15:17,677 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 183 transitions. Word has length 19 [2020-02-10 20:15:17,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:17,677 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 183 transitions. [2020-02-10 20:15:17,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 183 transitions. [2020-02-10 20:15:17,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:17,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:17,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:17,678 INFO L427 AbstractCegarLoop]: === Iteration 677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:17,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:17,679 INFO L82 PathProgramCache]: Analyzing trace with hash 598823932, now seen corresponding path program 673 times [2020-02-10 20:15:17,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:17,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273165755] [2020-02-10 20:15:17,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:17,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273165755] [2020-02-10 20:15:17,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:17,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:17,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090941643] [2020-02-10 20:15:17,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:17,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:17,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:17,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:17,852 INFO L87 Difference]: Start difference. First operand 77 states and 183 transitions. Second operand 8 states. [2020-02-10 20:15:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:17,914 INFO L93 Difference]: Finished difference Result 136 states and 266 transitions. [2020-02-10 20:15:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:17,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:17,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:17,915 INFO L225 Difference]: With dead ends: 136 [2020-02-10 20:15:17,915 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 20:15:17,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 20:15:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2020-02-10 20:15:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:15:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 186 transitions. [2020-02-10 20:15:17,918 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 186 transitions. Word has length 19 [2020-02-10 20:15:17,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:17,918 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 186 transitions. [2020-02-10 20:15:17,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 186 transitions. [2020-02-10 20:15:17,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:17,919 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:17,919 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:17,919 INFO L427 AbstractCegarLoop]: === Iteration 678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1718953762, now seen corresponding path program 674 times [2020-02-10 20:15:17,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:17,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869737906] [2020-02-10 20:15:17,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:18,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869737906] [2020-02-10 20:15:18,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:18,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:18,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660485904] [2020-02-10 20:15:18,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:18,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:18,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:18,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:18,100 INFO L87 Difference]: Start difference. First operand 79 states and 186 transitions. Second operand 8 states. [2020-02-10 20:15:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:18,146 INFO L93 Difference]: Finished difference Result 132 states and 255 transitions. [2020-02-10 20:15:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:18,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:18,146 INFO L225 Difference]: With dead ends: 132 [2020-02-10 20:15:18,147 INFO L226 Difference]: Without dead ends: 120 [2020-02-10 20:15:18,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-02-10 20:15:18,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 77. [2020-02-10 20:15:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 20:15:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 181 transitions. [2020-02-10 20:15:18,149 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 181 transitions. Word has length 19 [2020-02-10 20:15:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:18,149 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 181 transitions. [2020-02-10 20:15:18,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 181 transitions. [2020-02-10 20:15:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:18,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:18,150 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:18,150 INFO L427 AbstractCegarLoop]: === Iteration 679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:18,150 INFO L82 PathProgramCache]: Analyzing trace with hash -145878566, now seen corresponding path program 675 times [2020-02-10 20:15:18,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:18,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599993893] [2020-02-10 20:15:18,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:18,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599993893] [2020-02-10 20:15:18,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:18,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:18,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405581513] [2020-02-10 20:15:18,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:18,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:18,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:18,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:18,359 INFO L87 Difference]: Start difference. First operand 77 states and 181 transitions. Second operand 8 states. [2020-02-10 20:15:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:18,421 INFO L93 Difference]: Finished difference Result 140 states and 276 transitions. [2020-02-10 20:15:18,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:18,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:18,422 INFO L225 Difference]: With dead ends: 140 [2020-02-10 20:15:18,423 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 20:15:18,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 20:15:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2020-02-10 20:15:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:15:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 189 transitions. [2020-02-10 20:15:18,425 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 189 transitions. Word has length 19 [2020-02-10 20:15:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:18,425 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 189 transitions. [2020-02-10 20:15:18,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 189 transitions. [2020-02-10 20:15:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:18,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:18,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:18,426 INFO L427 AbstractCegarLoop]: === Iteration 680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:18,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash -891175710, now seen corresponding path program 676 times [2020-02-10 20:15:18,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:18,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180531640] [2020-02-10 20:15:18,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:18,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180531640] [2020-02-10 20:15:18,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:18,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:18,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061186724] [2020-02-10 20:15:18,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:18,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:18,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:18,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:18,603 INFO L87 Difference]: Start difference. First operand 81 states and 189 transitions. Second operand 8 states. [2020-02-10 20:15:18,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:18,669 INFO L93 Difference]: Finished difference Result 138 states and 268 transitions. [2020-02-10 20:15:18,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:18,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:18,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:18,670 INFO L225 Difference]: With dead ends: 138 [2020-02-10 20:15:18,670 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 20:15:18,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 20:15:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2020-02-10 20:15:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 20:15:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 179 transitions. [2020-02-10 20:15:18,673 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 179 transitions. Word has length 19 [2020-02-10 20:15:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:18,673 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 179 transitions. [2020-02-10 20:15:18,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:18,673 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 179 transitions. [2020-02-10 20:15:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:18,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:18,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:18,674 INFO L427 AbstractCegarLoop]: === Iteration 681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:18,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:18,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1183723960, now seen corresponding path program 677 times [2020-02-10 20:15:18,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:18,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989983441] [2020-02-10 20:15:18,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:18,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989983441] [2020-02-10 20:15:18,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:18,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:18,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953326116] [2020-02-10 20:15:18,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:18,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:18,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:18,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:18,860 INFO L87 Difference]: Start difference. First operand 77 states and 179 transitions. Second operand 8 states. [2020-02-10 20:15:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:18,903 INFO L93 Difference]: Finished difference Result 130 states and 249 transitions. [2020-02-10 20:15:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:18,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:18,904 INFO L225 Difference]: With dead ends: 130 [2020-02-10 20:15:18,904 INFO L226 Difference]: Without dead ends: 120 [2020-02-10 20:15:18,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-02-10 20:15:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 79. [2020-02-10 20:15:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:15:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 182 transitions. [2020-02-10 20:15:18,907 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 182 transitions. Word has length 19 [2020-02-10 20:15:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:18,907 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 182 transitions. [2020-02-10 20:15:18,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 182 transitions. [2020-02-10 20:15:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:18,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:18,908 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:18,908 INFO L427 AbstractCegarLoop]: === Iteration 682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:18,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash 328417306, now seen corresponding path program 678 times [2020-02-10 20:15:18,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:18,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118352361] [2020-02-10 20:15:18,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15: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:15:19,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118352361] [2020-02-10 20:15:19,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:19,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:19,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161087665] [2020-02-10 20:15:19,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:19,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:19,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:19,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:19,089 INFO L87 Difference]: Start difference. First operand 79 states and 182 transitions. Second operand 8 states. [2020-02-10 20:15:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:19,152 INFO L93 Difference]: Finished difference Result 132 states and 252 transitions. [2020-02-10 20:15:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:19,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:19,153 INFO L225 Difference]: With dead ends: 132 [2020-02-10 20:15:19,153 INFO L226 Difference]: Without dead ends: 116 [2020-02-10 20:15:19,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-02-10 20:15:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2020-02-10 20:15:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:15:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 174 transitions. [2020-02-10 20:15:19,156 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 174 transitions. Word has length 19 [2020-02-10 20:15:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:19,156 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 174 transitions. [2020-02-10 20:15:19,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 174 transitions. [2020-02-10 20:15:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:19,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:19,156 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:19,157 INFO L427 AbstractCegarLoop]: === Iteration 683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:19,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1001613922, now seen corresponding path program 679 times [2020-02-10 20:15:19,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:19,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783057189] [2020-02-10 20:15:19,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:19,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783057189] [2020-02-10 20:15:19,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:19,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:19,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201778329] [2020-02-10 20:15:19,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:19,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:19,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:19,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:19,350 INFO L87 Difference]: Start difference. First operand 75 states and 174 transitions. Second operand 8 states. [2020-02-10 20:15:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:19,417 INFO L93 Difference]: Finished difference Result 133 states and 254 transitions. [2020-02-10 20:15:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:19,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:19,418 INFO L225 Difference]: With dead ends: 133 [2020-02-10 20:15:19,418 INFO L226 Difference]: Without dead ends: 119 [2020-02-10 20:15:19,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-02-10 20:15:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 75. [2020-02-10 20:15:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:15:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 172 transitions. [2020-02-10 20:15:19,420 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 172 transitions. Word has length 19 [2020-02-10 20:15:19,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:19,420 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 172 transitions. [2020-02-10 20:15:19,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 172 transitions. [2020-02-10 20:15:19,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:19,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:19,421 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:19,421 INFO L427 AbstractCegarLoop]: === Iteration 684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:19,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:19,421 INFO L82 PathProgramCache]: Analyzing trace with hash 118515908, now seen corresponding path program 680 times [2020-02-10 20:15:19,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:19,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858031532] [2020-02-10 20:15:19,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:19,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858031532] [2020-02-10 20:15:19,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:19,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:19,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586284709] [2020-02-10 20:15:19,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:19,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:19,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:19,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:19,608 INFO L87 Difference]: Start difference. First operand 75 states and 172 transitions. Second operand 8 states. [2020-02-10 20:15:19,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:19,655 INFO L93 Difference]: Finished difference Result 129 states and 243 transitions. [2020-02-10 20:15:19,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:19,656 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:19,656 INFO L225 Difference]: With dead ends: 129 [2020-02-10 20:15:19,656 INFO L226 Difference]: Without dead ends: 117 [2020-02-10 20:15:19,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-02-10 20:15:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2020-02-10 20:15:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-02-10 20:15:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 167 transitions. [2020-02-10 20:15:19,659 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 167 transitions. Word has length 19 [2020-02-10 20:15:19,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:19,659 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 167 transitions. [2020-02-10 20:15:19,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:19,659 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 167 transitions. [2020-02-10 20:15:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:19,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:19,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:19,660 INFO L427 AbstractCegarLoop]: === Iteration 685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:19,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:19,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2074699302, now seen corresponding path program 681 times [2020-02-10 20:15:19,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:19,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964677245] [2020-02-10 20:15:19,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:19,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964677245] [2020-02-10 20:15:19,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:19,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:19,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966006563] [2020-02-10 20:15:19,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:19,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:19,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:19,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:19,853 INFO L87 Difference]: Start difference. First operand 73 states and 167 transitions. Second operand 8 states. [2020-02-10 20:15:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:19,922 INFO L93 Difference]: Finished difference Result 133 states and 257 transitions. [2020-02-10 20:15:19,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:19,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:19,922 INFO L225 Difference]: With dead ends: 133 [2020-02-10 20:15:19,923 INFO L226 Difference]: Without dead ends: 119 [2020-02-10 20:15:19,923 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-02-10 20:15:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 78. [2020-02-10 20:15:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-02-10 20:15:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 177 transitions. [2020-02-10 20:15:19,925 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 177 transitions. Word has length 19 [2020-02-10 20:15:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:19,925 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 177 transitions. [2020-02-10 20:15:19,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 177 transitions. [2020-02-10 20:15:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:19,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:19,925 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:19,926 INFO L427 AbstractCegarLoop]: === Iteration 686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:19,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:19,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1578211076, now seen corresponding path program 682 times [2020-02-10 20:15:19,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:19,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833263806] [2020-02-10 20:15:19,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:20,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833263806] [2020-02-10 20:15:20,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:20,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:20,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019672801] [2020-02-10 20:15:20,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:20,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:20,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:20,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:20,115 INFO L87 Difference]: Start difference. First operand 78 states and 177 transitions. Second operand 8 states. [2020-02-10 20:15:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:20,181 INFO L93 Difference]: Finished difference Result 123 states and 241 transitions. [2020-02-10 20:15:20,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:20,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:20,182 INFO L225 Difference]: With dead ends: 123 [2020-02-10 20:15:20,182 INFO L226 Difference]: Without dead ends: 105 [2020-02-10 20:15:20,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-02-10 20:15:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2020-02-10 20:15:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-02-10 20:15:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 165 transitions. [2020-02-10 20:15:20,185 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 165 transitions. Word has length 19 [2020-02-10 20:15:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:20,185 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 165 transitions. [2020-02-10 20:15:20,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 165 transitions. [2020-02-10 20:15:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:20,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:20,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:20,186 INFO L427 AbstractCegarLoop]: === Iteration 687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:20,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1194227064, now seen corresponding path program 683 times [2020-02-10 20:15:20,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:20,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543066547] [2020-02-10 20:15:20,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:20,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:15:20,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543066547] [2020-02-10 20:15:20,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:20,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:20,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352605407] [2020-02-10 20:15:20,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:20,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:20,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:20,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:20,388 INFO L87 Difference]: Start difference. First operand 73 states and 165 transitions. Second operand 8 states. [2020-02-10 20:15:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:20,434 INFO L93 Difference]: Finished difference Result 126 states and 236 transitions. [2020-02-10 20:15:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:20,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:20,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:20,435 INFO L225 Difference]: With dead ends: 126 [2020-02-10 20:15:20,435 INFO L226 Difference]: Without dead ends: 116 [2020-02-10 20:15:20,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:20,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-02-10 20:15:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2020-02-10 20:15:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:15:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 168 transitions. [2020-02-10 20:15:20,437 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 168 transitions. Word has length 19 [2020-02-10 20:15:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:20,437 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 168 transitions. [2020-02-10 20:15:20,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 168 transitions. [2020-02-10 20:15:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:20,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:20,438 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:20,438 INFO L427 AbstractCegarLoop]: === Iteration 688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:20,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:20,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1611335236, now seen corresponding path program 684 times [2020-02-10 20:15:20,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:20,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055904614] [2020-02-10 20:15:20,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:20,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055904614] [2020-02-10 20:15:20,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:20,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:20,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387913151] [2020-02-10 20:15:20,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:20,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:20,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:20,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:20,624 INFO L87 Difference]: Start difference. First operand 75 states and 168 transitions. Second operand 8 states. [2020-02-10 20:15:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:20,687 INFO L93 Difference]: Finished difference Result 120 states and 232 transitions. [2020-02-10 20:15:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:20,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:20,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:20,688 INFO L225 Difference]: With dead ends: 120 [2020-02-10 20:15:20,688 INFO L226 Difference]: Without dead ends: 103 [2020-02-10 20:15:20,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-02-10 20:15:20,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2020-02-10 20:15:20,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 20:15:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 160 transitions. [2020-02-10 20:15:20,690 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 160 transitions. Word has length 19 [2020-02-10 20:15:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:20,691 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 160 transitions. [2020-02-10 20:15:20,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 160 transitions. [2020-02-10 20:15:20,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:20,691 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:20,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:20,691 INFO L427 AbstractCegarLoop]: === Iteration 689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:20,692 INFO L82 PathProgramCache]: Analyzing trace with hash 948213022, now seen corresponding path program 685 times [2020-02-10 20:15:20,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:20,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250889287] [2020-02-10 20:15:20,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:20,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:15:20,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250889287] [2020-02-10 20:15:20,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:20,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:20,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800511413] [2020-02-10 20:15:20,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:20,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:20,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:20,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:20,879 INFO L87 Difference]: Start difference. First operand 71 states and 160 transitions. Second operand 8 states. [2020-02-10 20:15:20,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:20,943 INFO L93 Difference]: Finished difference Result 129 states and 245 transitions. [2020-02-10 20:15:20,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:20,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:20,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:20,944 INFO L225 Difference]: With dead ends: 129 [2020-02-10 20:15:20,945 INFO L226 Difference]: Without dead ends: 115 [2020-02-10 20:15:20,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:20,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-02-10 20:15:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2020-02-10 20:15:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 20:15:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 156 transitions. [2020-02-10 20:15:20,947 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 156 transitions. Word has length 19 [2020-02-10 20:15:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:20,947 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 156 transitions. [2020-02-10 20:15:20,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:20,947 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 156 transitions. [2020-02-10 20:15:20,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:20,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:20,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:20,947 INFO L427 AbstractCegarLoop]: === Iteration 690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:20,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:20,948 INFO L82 PathProgramCache]: Analyzing trace with hash 202915878, now seen corresponding path program 686 times [2020-02-10 20:15:20,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:20,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819916866] [2020-02-10 20:15:20,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:21,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819916866] [2020-02-10 20:15:21,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:21,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:21,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164238196] [2020-02-10 20:15:21,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:21,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:21,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:21,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:21,140 INFO L87 Difference]: Start difference. First operand 71 states and 156 transitions. Second operand 8 states. [2020-02-10 20:15:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:21,205 INFO L93 Difference]: Finished difference Result 127 states and 237 transitions. [2020-02-10 20:15:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:21,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:21,206 INFO L225 Difference]: With dead ends: 127 [2020-02-10 20:15:21,206 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 20:15:21,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 20:15:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 67. [2020-02-10 20:15:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-02-10 20:15:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 144 transitions. [2020-02-10 20:15:21,208 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 144 transitions. Word has length 19 [2020-02-10 20:15:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:21,208 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 144 transitions. [2020-02-10 20:15:21,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 144 transitions. [2020-02-10 20:15:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:21,209 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:21,209 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:21,209 INFO L427 AbstractCegarLoop]: === Iteration 691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:21,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:21,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1001613922, now seen corresponding path program 687 times [2020-02-10 20:15:21,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:21,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503606440] [2020-02-10 20:15:21,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:21,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:15:21,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503606440] [2020-02-10 20:15:21,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:21,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:21,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877255988] [2020-02-10 20:15:21,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:21,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:21,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:21,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:21,403 INFO L87 Difference]: Start difference. First operand 67 states and 144 transitions. Second operand 8 states. [2020-02-10 20:15:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:21,470 INFO L93 Difference]: Finished difference Result 120 states and 219 transitions. [2020-02-10 20:15:21,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:21,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:21,471 INFO L225 Difference]: With dead ends: 120 [2020-02-10 20:15:21,471 INFO L226 Difference]: Without dead ends: 106 [2020-02-10 20:15:21,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:21,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-02-10 20:15:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2020-02-10 20:15:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-02-10 20:15:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 127 transitions. [2020-02-10 20:15:21,473 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 127 transitions. Word has length 19 [2020-02-10 20:15:21,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:21,474 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 127 transitions. [2020-02-10 20:15:21,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 127 transitions. [2020-02-10 20:15:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:21,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:21,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:21,475 INFO L427 AbstractCegarLoop]: === Iteration 692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:21,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:21,475 INFO L82 PathProgramCache]: Analyzing trace with hash -32729882, now seen corresponding path program 688 times [2020-02-10 20:15:21,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:21,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90193] [2020-02-10 20:15:21,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:21,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90193] [2020-02-10 20:15:21,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:21,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:21,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160869604] [2020-02-10 20:15:21,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:21,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:21,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:21,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:21,663 INFO L87 Difference]: Start difference. First operand 61 states and 127 transitions. Second operand 8 states. [2020-02-10 20:15:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:21,730 INFO L93 Difference]: Finished difference Result 110 states and 203 transitions. [2020-02-10 20:15:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:21,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:21,731 INFO L225 Difference]: With dead ends: 110 [2020-02-10 20:15:21,731 INFO L226 Difference]: Without dead ends: 92 [2020-02-10 20:15:21,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-02-10 20:15:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2020-02-10 20:15:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-02-10 20:15:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 113 transitions. [2020-02-10 20:15:21,733 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 113 transitions. Word has length 19 [2020-02-10 20:15:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:21,734 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 113 transitions. [2020-02-10 20:15:21,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 113 transitions. [2020-02-10 20:15:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:21,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:21,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:21,734 INFO L427 AbstractCegarLoop]: === Iteration 693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:21,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:21,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1773987900, now seen corresponding path program 689 times [2020-02-10 20:15:21,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:21,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252224094] [2020-02-10 20:15:21,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:21,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252224094] [2020-02-10 20:15:21,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:21,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:21,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683915326] [2020-02-10 20:15:21,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:21,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:21,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:21,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:21,929 INFO L87 Difference]: Start difference. First operand 56 states and 113 transitions. Second operand 8 states. [2020-02-10 20:15:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:21,995 INFO L93 Difference]: Finished difference Result 108 states and 199 transitions. [2020-02-10 20:15:21,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:21,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:21,996 INFO L225 Difference]: With dead ends: 108 [2020-02-10 20:15:21,996 INFO L226 Difference]: Without dead ends: 96 [2020-02-10 20:15:21,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-02-10 20:15:21,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 60. [2020-02-10 20:15:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-02-10 20:15:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 121 transitions. [2020-02-10 20:15:21,998 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 121 transitions. Word has length 19 [2020-02-10 20:15:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:21,998 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 121 transitions. [2020-02-10 20:15:21,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 121 transitions. [2020-02-10 20:15:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:21,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:21,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:21,998 INFO L427 AbstractCegarLoop]: === Iteration 694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:21,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1662104866, now seen corresponding path program 690 times [2020-02-10 20:15:21,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:21,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898965519] [2020-02-10 20:15:21,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:22,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898965519] [2020-02-10 20:15:22,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:22,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:22,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782243044] [2020-02-10 20:15:22,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:22,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:22,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:22,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:22,196 INFO L87 Difference]: Start difference. First operand 60 states and 121 transitions. Second operand 8 states. [2020-02-10 20:15:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:22,259 INFO L93 Difference]: Finished difference Result 95 states and 178 transitions. [2020-02-10 20:15:22,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:22,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:22,260 INFO L225 Difference]: With dead ends: 95 [2020-02-10 20:15:22,260 INFO L226 Difference]: Without dead ends: 74 [2020-02-10 20:15:22,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-02-10 20:15:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2020-02-10 20:15:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-02-10 20:15:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 103 transitions. [2020-02-10 20:15:22,262 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 103 transitions. Word has length 19 [2020-02-10 20:15:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:22,262 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 103 transitions. [2020-02-10 20:15:22,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 103 transitions. [2020-02-10 20:15:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:22,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:22,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:22,263 INFO L427 AbstractCegarLoop]: === Iteration 695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:22,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:22,263 INFO L82 PathProgramCache]: Analyzing trace with hash 171031428, now seen corresponding path program 691 times [2020-02-10 20:15:22,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:22,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032217024] [2020-02-10 20:15:22,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:22,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032217024] [2020-02-10 20:15:22,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:22,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:22,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297395597] [2020-02-10 20:15:22,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:22,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:22,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:22,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:22,459 INFO L87 Difference]: Start difference. First operand 52 states and 103 transitions. Second operand 8 states. [2020-02-10 20:15:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:22,502 INFO L93 Difference]: Finished difference Result 101 states and 182 transitions. [2020-02-10 20:15:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:22,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:22,503 INFO L225 Difference]: With dead ends: 101 [2020-02-10 20:15:22,503 INFO L226 Difference]: Without dead ends: 91 [2020-02-10 20:15:22,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-02-10 20:15:22,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 56. [2020-02-10 20:15:22,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-02-10 20:15:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 113 transitions. [2020-02-10 20:15:22,505 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 113 transitions. Word has length 19 [2020-02-10 20:15:22,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:22,505 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 113 transitions. [2020-02-10 20:15:22,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 113 transitions. [2020-02-10 20:15:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:22,506 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:22,506 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:22,506 INFO L427 AbstractCegarLoop]: === Iteration 696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:22,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:22,507 INFO L82 PathProgramCache]: Analyzing trace with hash -684275226, now seen corresponding path program 692 times [2020-02-10 20:15:22,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:22,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419464320] [2020-02-10 20:15:22,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:22,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419464320] [2020-02-10 20:15:22,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:22,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:22,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908513749] [2020-02-10 20:15:22,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:22,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:22,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:22,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:22,702 INFO L87 Difference]: Start difference. First operand 56 states and 113 transitions. Second operand 8 states. [2020-02-10 20:15:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:22,767 INFO L93 Difference]: Finished difference Result 103 states and 185 transitions. [2020-02-10 20:15:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:22,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:22,767 INFO L225 Difference]: With dead ends: 103 [2020-02-10 20:15:22,768 INFO L226 Difference]: Without dead ends: 89 [2020-02-10 20:15:22,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-02-10 20:15:22,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 54. [2020-02-10 20:15:22,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-02-10 20:15:22,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 108 transitions. [2020-02-10 20:15:22,769 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 108 transitions. Word has length 19 [2020-02-10 20:15:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:22,770 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 108 transitions. [2020-02-10 20:15:22,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 108 transitions. [2020-02-10 20:15:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:22,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:22,770 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:22,770 INFO L427 AbstractCegarLoop]: === Iteration 697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:22,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:22,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1781972386, now seen corresponding path program 693 times [2020-02-10 20:15:22,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:22,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623632182] [2020-02-10 20:15:22,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:22,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:15:22,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623632182] [2020-02-10 20:15:22,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:22,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:22,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538442269] [2020-02-10 20:15:22,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:22,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:22,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:22,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:22,968 INFO L87 Difference]: Start difference. First operand 54 states and 108 transitions. Second operand 8 states. [2020-02-10 20:15:23,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:23,015 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2020-02-10 20:15:23,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:23,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:23,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:23,016 INFO L225 Difference]: With dead ends: 97 [2020-02-10 20:15:23,016 INFO L226 Difference]: Without dead ends: 87 [2020-02-10 20:15:23,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-02-10 20:15:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2020-02-10 20:15:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-02-10 20:15:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 111 transitions. [2020-02-10 20:15:23,018 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 111 transitions. Word has length 19 [2020-02-10 20:15:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:23,019 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 111 transitions. [2020-02-10 20:15:23,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 111 transitions. [2020-02-10 20:15:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:23,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:23,019 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:23,019 INFO L427 AbstractCegarLoop]: === Iteration 698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:23,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:23,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1023589914, now seen corresponding path program 694 times [2020-02-10 20:15:23,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:23,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989614313] [2020-02-10 20:15:23,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:23,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989614313] [2020-02-10 20:15:23,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:23,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:23,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748162300] [2020-02-10 20:15:23,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:23,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:23,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:23,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:23,212 INFO L87 Difference]: Start difference. First operand 56 states and 111 transitions. Second operand 8 states. [2020-02-10 20:15:23,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:23,277 INFO L93 Difference]: Finished difference Result 91 states and 168 transitions. [2020-02-10 20:15:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:23,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:23,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:23,277 INFO L225 Difference]: With dead ends: 91 [2020-02-10 20:15:23,278 INFO L226 Difference]: Without dead ends: 76 [2020-02-10 20:15:23,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:23,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-02-10 20:15:23,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2020-02-10 20:15:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-02-10 20:15:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 106 transitions. [2020-02-10 20:15:23,279 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 106 transitions. Word has length 19 [2020-02-10 20:15:23,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:23,280 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 106 transitions. [2020-02-10 20:15:23,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 106 transitions. [2020-02-10 20:15:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:23,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:23,280 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:23,281 INFO L427 AbstractCegarLoop]: === Iteration 699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:23,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1757360606, now seen corresponding path program 695 times [2020-02-10 20:15:23,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:23,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933079732] [2020-02-10 20:15:23,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:23,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933079732] [2020-02-10 20:15:23,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:23,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:23,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210348232] [2020-02-10 20:15:23,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:23,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:23,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:23,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:23,477 INFO L87 Difference]: Start difference. First operand 54 states and 106 transitions. Second operand 8 states. [2020-02-10 20:15:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:23,537 INFO L93 Difference]: Finished difference Result 84 states and 153 transitions. [2020-02-10 20:15:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:23,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:23,538 INFO L225 Difference]: With dead ends: 84 [2020-02-10 20:15:23,538 INFO L226 Difference]: Without dead ends: 72 [2020-02-10 20:15:23,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-02-10 20:15:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2020-02-10 20:15:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-02-10 20:15:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 114 transitions. [2020-02-10 20:15:23,540 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 114 transitions. Word has length 19 [2020-02-10 20:15:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:23,540 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 114 transitions. [2020-02-10 20:15:23,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 114 transitions. [2020-02-10 20:15:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:23,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:23,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:23,540 INFO L427 AbstractCegarLoop]: === Iteration 700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:23,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:23,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1781972386, now seen corresponding path program 696 times [2020-02-10 20:15:23,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:23,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086567383] [2020-02-10 20:15:23,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:23,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086567383] [2020-02-10 20:15:23,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:23,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:23,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756468016] [2020-02-10 20:15:23,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:23,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:23,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:23,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:23,738 INFO L87 Difference]: Start difference. First operand 58 states and 114 transitions. Second operand 8 states. [2020-02-10 20:15:23,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:23,800 INFO L93 Difference]: Finished difference Result 71 states and 132 transitions. [2020-02-10 20:15:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:23,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:23,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:23,801 INFO L225 Difference]: With dead ends: 71 [2020-02-10 20:15:23,801 INFO L226 Difference]: Without dead ends: 50 [2020-02-10 20:15:23,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:23,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-02-10 20:15:23,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-02-10 20:15:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:15:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 99 transitions. [2020-02-10 20:15:23,803 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 99 transitions. Word has length 19 [2020-02-10 20:15:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:23,803 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 99 transitions. [2020-02-10 20:15:23,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 99 transitions. [2020-02-10 20:15:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:23,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:23,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:23,804 INFO L427 AbstractCegarLoop]: === Iteration 701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:23,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:23,804 INFO L82 PathProgramCache]: Analyzing trace with hash -821726946, now seen corresponding path program 697 times [2020-02-10 20:15:23,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:23,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262424315] [2020-02-10 20:15:23,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:24,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:15:24,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262424315] [2020-02-10 20:15:24,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:24,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:24,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610919371] [2020-02-10 20:15:24,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:24,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:24,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:24,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:24,014 INFO L87 Difference]: Start difference. First operand 50 states and 99 transitions. Second operand 8 states. [2020-02-10 20:15:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:24,075 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2020-02-10 20:15:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:24,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:24,076 INFO L225 Difference]: With dead ends: 83 [2020-02-10 20:15:24,076 INFO L226 Difference]: Without dead ends: 73 [2020-02-10 20:15:24,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-02-10 20:15:24,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2020-02-10 20:15:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-02-10 20:15:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 100 transitions. [2020-02-10 20:15:24,078 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 100 transitions. Word has length 19 [2020-02-10 20:15:24,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:24,078 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 100 transitions. [2020-02-10 20:15:24,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 100 transitions. [2020-02-10 20:15:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:24,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:24,078 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:24,078 INFO L427 AbstractCegarLoop]: === Iteration 702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:24,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:24,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1061369284, now seen corresponding path program 698 times [2020-02-10 20:15:24,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:24,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841233862] [2020-02-10 20:15:24,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:24,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841233862] [2020-02-10 20:15:24,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:24,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:24,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284863813] [2020-02-10 20:15:24,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:24,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:24,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:24,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:24,300 INFO L87 Difference]: Start difference. First operand 51 states and 100 transitions. Second operand 8 states. [2020-02-10 20:15:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:24,349 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2020-02-10 20:15:24,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:24,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:24,350 INFO L225 Difference]: With dead ends: 83 [2020-02-10 20:15:24,350 INFO L226 Difference]: Without dead ends: 72 [2020-02-10 20:15:24,350 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-02-10 20:15:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2020-02-10 20:15:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:15:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 98 transitions. [2020-02-10 20:15:24,352 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 98 transitions. Word has length 19 [2020-02-10 20:15:24,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:24,352 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 98 transitions. [2020-02-10 20:15:24,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 98 transitions. [2020-02-10 20:15:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:24,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:24,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:24,353 INFO L427 AbstractCegarLoop]: === Iteration 703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:24,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1566429444, now seen corresponding path program 699 times [2020-02-10 20:15:24,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:24,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751331922] [2020-02-10 20:15:24,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:24,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751331922] [2020-02-10 20:15:24,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:24,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:24,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846237991] [2020-02-10 20:15:24,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:24,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:24,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:24,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:24,560 INFO L87 Difference]: Start difference. First operand 50 states and 98 transitions. Second operand 8 states. [2020-02-10 20:15:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:24,625 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2020-02-10 20:15:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:24,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:24,626 INFO L225 Difference]: With dead ends: 86 [2020-02-10 20:15:24,626 INFO L226 Difference]: Without dead ends: 76 [2020-02-10 20:15:24,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-02-10 20:15:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-02-10 20:15:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-02-10 20:15:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 101 transitions. [2020-02-10 20:15:24,628 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 101 transitions. Word has length 19 [2020-02-10 20:15:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:24,628 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 101 transitions. [2020-02-10 20:15:24,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 101 transitions. [2020-02-10 20:15:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:24,629 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:24,629 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:24,629 INFO L427 AbstractCegarLoop]: === Iteration 704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:24,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:24,629 INFO L82 PathProgramCache]: Analyzing trace with hash 144183864, now seen corresponding path program 700 times [2020-02-10 20:15:24,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:24,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724432608] [2020-02-10 20:15:24,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:24,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724432608] [2020-02-10 20:15:24,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:24,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:24,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907326502] [2020-02-10 20:15:24,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:24,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:24,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:24,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:24,840 INFO L87 Difference]: Start difference. First operand 52 states and 101 transitions. Second operand 8 states. [2020-02-10 20:15:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:24,903 INFO L93 Difference]: Finished difference Result 88 states and 146 transitions. [2020-02-10 20:15:24,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:24,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:24,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:24,904 INFO L225 Difference]: With dead ends: 88 [2020-02-10 20:15:24,904 INFO L226 Difference]: Without dead ends: 74 [2020-02-10 20:15:24,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:24,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-02-10 20:15:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2020-02-10 20:15:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:15:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 97 transitions. [2020-02-10 20:15:24,906 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 97 transitions. Word has length 19 [2020-02-10 20:15:24,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:24,906 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 97 transitions. [2020-02-10 20:15:24,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 97 transitions. [2020-02-10 20:15:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:24,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:24,907 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:24,907 INFO L427 AbstractCegarLoop]: === Iteration 705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:24,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:24,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2134454664, now seen corresponding path program 701 times [2020-02-10 20:15:24,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:24,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753888685] [2020-02-10 20:15:24,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:25,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:25,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753888685] [2020-02-10 20:15:25,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:25,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:25,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569149640] [2020-02-10 20:15:25,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:25,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:25,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:25,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:25,122 INFO L87 Difference]: Start difference. First operand 50 states and 97 transitions. Second operand 8 states. [2020-02-10 20:15:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:25,164 INFO L93 Difference]: Finished difference Result 86 states and 142 transitions. [2020-02-10 20:15:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:25,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:25,165 INFO L225 Difference]: With dead ends: 86 [2020-02-10 20:15:25,165 INFO L226 Difference]: Without dead ends: 76 [2020-02-10 20:15:25,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-02-10 20:15:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-02-10 20:15:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-02-10 20:15:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 100 transitions. [2020-02-10 20:15:25,167 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 100 transitions. Word has length 19 [2020-02-10 20:15:25,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:25,167 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 100 transitions. [2020-02-10 20:15:25,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 100 transitions. [2020-02-10 20:15:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:25,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:25,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:25,168 INFO L427 AbstractCegarLoop]: === Iteration 706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:25,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:25,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1305205978, now seen corresponding path program 702 times [2020-02-10 20:15:25,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:25,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924892838] [2020-02-10 20:15:25,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:25,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924892838] [2020-02-10 20:15:25,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:25,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:25,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232982173] [2020-02-10 20:15:25,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:25,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:25,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:25,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:25,378 INFO L87 Difference]: Start difference. First operand 52 states and 100 transitions. Second operand 8 states. [2020-02-10 20:15:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:25,440 INFO L93 Difference]: Finished difference Result 88 states and 145 transitions. [2020-02-10 20:15:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:25,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:25,440 INFO L225 Difference]: With dead ends: 88 [2020-02-10 20:15:25,441 INFO L226 Difference]: Without dead ends: 73 [2020-02-10 20:15:25,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-02-10 20:15:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 49. [2020-02-10 20:15:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-02-10 20:15:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 95 transitions. [2020-02-10 20:15:25,442 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 95 transitions. Word has length 19 [2020-02-10 20:15:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:25,443 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 95 transitions. [2020-02-10 20:15:25,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 95 transitions. [2020-02-10 20:15:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:25,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:25,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:25,443 INFO L427 AbstractCegarLoop]: === Iteration 707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:25,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:25,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1872802496, now seen corresponding path program 703 times [2020-02-10 20:15:25,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:25,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697985887] [2020-02-10 20:15:25,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:25,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697985887] [2020-02-10 20:15:25,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:25,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:25,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53346758] [2020-02-10 20:15:25,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:25,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:25,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:25,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:25,652 INFO L87 Difference]: Start difference. First operand 49 states and 95 transitions. Second operand 8 states. [2020-02-10 20:15:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:25,715 INFO L93 Difference]: Finished difference Result 81 states and 130 transitions. [2020-02-10 20:15:25,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:25,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:25,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:25,716 INFO L225 Difference]: With dead ends: 81 [2020-02-10 20:15:25,716 INFO L226 Difference]: Without dead ends: 71 [2020-02-10 20:15:25,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-02-10 20:15:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2020-02-10 20:15:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-02-10 20:15:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 94 transitions. [2020-02-10 20:15:25,717 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 94 transitions. Word has length 19 [2020-02-10 20:15:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:25,718 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 94 transitions. [2020-02-10 20:15:25,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 94 transitions. [2020-02-10 20:15:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:25,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:25,718 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:25,718 INFO L427 AbstractCegarLoop]: === Iteration 708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:25,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:25,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1633160158, now seen corresponding path program 704 times [2020-02-10 20:15:25,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:25,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726362244] [2020-02-10 20:15:25,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:25,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726362244] [2020-02-10 20:15:25,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:25,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:25,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835751868] [2020-02-10 20:15:25,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:25,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:25,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:25,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:25,937 INFO L87 Difference]: Start difference. First operand 49 states and 94 transitions. Second operand 8 states. [2020-02-10 20:15:25,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:25,981 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2020-02-10 20:15:25,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:25,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:25,982 INFO L225 Difference]: With dead ends: 81 [2020-02-10 20:15:25,982 INFO L226 Difference]: Without dead ends: 70 [2020-02-10 20:15:25,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-02-10 20:15:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2020-02-10 20:15:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-02-10 20:15:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 92 transitions. [2020-02-10 20:15:25,983 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 92 transitions. Word has length 19 [2020-02-10 20:15:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:25,984 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 92 transitions. [2020-02-10 20:15:25,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 92 transitions. [2020-02-10 20:15:25,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:25,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:25,984 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:25,984 INFO L427 AbstractCegarLoop]: === Iteration 709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:25,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:25,984 INFO L82 PathProgramCache]: Analyzing trace with hash 799717116, now seen corresponding path program 705 times [2020-02-10 20:15:25,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:25,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095536644] [2020-02-10 20:15:25,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:26,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095536644] [2020-02-10 20:15:26,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:26,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:26,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538306105] [2020-02-10 20:15:26,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:26,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:26,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:26,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:26,181 INFO L87 Difference]: Start difference. First operand 48 states and 92 transitions. Second operand 8 states. [2020-02-10 20:15:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:26,243 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2020-02-10 20:15:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:26,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:26,244 INFO L225 Difference]: With dead ends: 83 [2020-02-10 20:15:26,244 INFO L226 Difference]: Without dead ends: 73 [2020-02-10 20:15:26,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:26,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-02-10 20:15:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2020-02-10 20:15:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:15:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 95 transitions. [2020-02-10 20:15:26,246 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 95 transitions. Word has length 19 [2020-02-10 20:15:26,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:26,246 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 95 transitions. [2020-02-10 20:15:26,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 95 transitions. [2020-02-10 20:15:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:26,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:26,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:26,247 INFO L427 AbstractCegarLoop]: === Iteration 710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:26,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:26,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1754696120, now seen corresponding path program 706 times [2020-02-10 20:15:26,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:26,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238230079] [2020-02-10 20:15:26,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:26,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238230079] [2020-02-10 20:15:26,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:26,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:26,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443993499] [2020-02-10 20:15:26,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:26,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:26,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:26,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:26,446 INFO L87 Difference]: Start difference. First operand 50 states and 95 transitions. Second operand 8 states. [2020-02-10 20:15:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:26,506 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2020-02-10 20:15:26,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:26,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:26,507 INFO L225 Difference]: With dead ends: 77 [2020-02-10 20:15:26,507 INFO L226 Difference]: Without dead ends: 62 [2020-02-10 20:15:26,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-02-10 20:15:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2020-02-10 20:15:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-02-10 20:15:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 91 transitions. [2020-02-10 20:15:26,509 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 91 transitions. Word has length 19 [2020-02-10 20:15:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:26,509 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 91 transitions. [2020-02-10 20:15:26,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 91 transitions. [2020-02-10 20:15:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:26,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:26,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:26,510 INFO L427 AbstractCegarLoop]: === Iteration 711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:26,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:26,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2123951560, now seen corresponding path program 707 times [2020-02-10 20:15:26,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:26,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480292256] [2020-02-10 20:15:26,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:26,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480292256] [2020-02-10 20:15:26,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:26,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:26,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451765599] [2020-02-10 20:15:26,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:26,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:26,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:26,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:26,713 INFO L87 Difference]: Start difference. First operand 48 states and 91 transitions. Second operand 8 states. [2020-02-10 20:15:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:26,755 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2020-02-10 20:15:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:26,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:26,756 INFO L225 Difference]: With dead ends: 83 [2020-02-10 20:15:26,756 INFO L226 Difference]: Without dead ends: 73 [2020-02-10 20:15:26,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-02-10 20:15:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2020-02-10 20:15:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:15:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 94 transitions. [2020-02-10 20:15:26,758 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 94 transitions. Word has length 19 [2020-02-10 20:15:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:26,758 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 94 transitions. [2020-02-10 20:15:26,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 94 transitions. [2020-02-10 20:15:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:26,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:26,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:26,759 INFO L427 AbstractCegarLoop]: === Iteration 712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:26,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:26,759 INFO L82 PathProgramCache]: Analyzing trace with hash -634546564, now seen corresponding path program 708 times [2020-02-10 20:15:26,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:26,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778145490] [2020-02-10 20:15:26,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:26,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:15:26,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778145490] [2020-02-10 20:15:26,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:26,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:26,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741704004] [2020-02-10 20:15:26,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:26,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:26,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:26,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:26,959 INFO L87 Difference]: Start difference. First operand 50 states and 94 transitions. Second operand 8 states. [2020-02-10 20:15:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:27,023 INFO L93 Difference]: Finished difference Result 77 states and 131 transitions. [2020-02-10 20:15:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:27,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:27,023 INFO L225 Difference]: With dead ends: 77 [2020-02-10 20:15:27,024 INFO L226 Difference]: Without dead ends: 61 [2020-02-10 20:15:27,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-02-10 20:15:27,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2020-02-10 20:15:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-02-10 20:15:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 89 transitions. [2020-02-10 20:15:27,025 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 89 transitions. Word has length 19 [2020-02-10 20:15:27,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:27,025 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 89 transitions. [2020-02-10 20:15:27,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 89 transitions. [2020-02-10 20:15:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:27,026 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:27,026 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:27,026 INFO L427 AbstractCegarLoop]: === Iteration 713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:27,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:27,026 INFO L82 PathProgramCache]: Analyzing trace with hash -472337856, now seen corresponding path program 709 times [2020-02-10 20:15:27,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:27,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513967104] [2020-02-10 20:15:27,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:27,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513967104] [2020-02-10 20:15:27,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:27,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:27,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171477195] [2020-02-10 20:15:27,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:27,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:27,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:27,238 INFO L87 Difference]: Start difference. First operand 47 states and 89 transitions. Second operand 8 states. [2020-02-10 20:15:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:27,302 INFO L93 Difference]: Finished difference Result 79 states and 126 transitions. [2020-02-10 20:15:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:27,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:27,303 INFO L225 Difference]: With dead ends: 79 [2020-02-10 20:15:27,303 INFO L226 Difference]: Without dead ends: 69 [2020-02-10 20:15:27,303 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-02-10 20:15:27,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2020-02-10 20:15:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-02-10 20:15:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 87 transitions. [2020-02-10 20:15:27,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 87 transitions. Word has length 19 [2020-02-10 20:15:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:27,305 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 87 transitions. [2020-02-10 20:15:27,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. [2020-02-10 20:15:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:27,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:27,306 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:27,306 INFO L427 AbstractCegarLoop]: === Iteration 714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:27,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1238275452, now seen corresponding path program 710 times [2020-02-10 20:15:27,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:27,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438064493] [2020-02-10 20:15:27,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:27,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438064493] [2020-02-10 20:15:27,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:27,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:27,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009697190] [2020-02-10 20:15:27,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:27,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:27,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:27,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:27,512 INFO L87 Difference]: Start difference. First operand 47 states and 87 transitions. Second operand 8 states. [2020-02-10 20:15:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:27,572 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2020-02-10 20:15:27,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:27,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:27,573 INFO L225 Difference]: With dead ends: 81 [2020-02-10 20:15:27,573 INFO L226 Difference]: Without dead ends: 67 [2020-02-10 20:15:27,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-02-10 20:15:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2020-02-10 20:15:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-02-10 20:15:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 82 transitions. [2020-02-10 20:15:27,575 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 82 transitions. Word has length 19 [2020-02-10 20:15:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:27,575 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 82 transitions. [2020-02-10 20:15:27,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 82 transitions. [2020-02-10 20:15:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:27,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:27,576 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:27,576 INFO L427 AbstractCegarLoop]: === Iteration 715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:27,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1872802496, now seen corresponding path program 711 times [2020-02-10 20:15:27,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:27,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93032672] [2020-02-10 20:15:27,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:27,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93032672] [2020-02-10 20:15:27,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:27,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:27,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126743615] [2020-02-10 20:15:27,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:27,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:27,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:27,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:27,777 INFO L87 Difference]: Start difference. First operand 45 states and 82 transitions. Second operand 8 states. [2020-02-10 20:15:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:27,838 INFO L93 Difference]: Finished difference Result 76 states and 118 transitions. [2020-02-10 20:15:27,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:27,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:27,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:27,838 INFO L225 Difference]: With dead ends: 76 [2020-02-10 20:15:27,839 INFO L226 Difference]: Without dead ends: 66 [2020-02-10 20:15:27,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:27,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-02-10 20:15:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2020-02-10 20:15:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-02-10 20:15:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 77 transitions. [2020-02-10 20:15:27,840 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 77 transitions. Word has length 19 [2020-02-10 20:15:27,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:27,841 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 77 transitions. [2020-02-10 20:15:27,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:27,841 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2020-02-10 20:15:27,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:27,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:27,841 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:27,841 INFO L427 AbstractCegarLoop]: === Iteration 716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:27,841 INFO L82 PathProgramCache]: Analyzing trace with hash 143755162, now seen corresponding path program 712 times [2020-02-10 20:15:27,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:27,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135384197] [2020-02-10 20:15:27,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:28,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135384197] [2020-02-10 20:15:28,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:28,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:28,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403501428] [2020-02-10 20:15:28,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:28,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:28,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:28,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:28,037 INFO L87 Difference]: Start difference. First operand 43 states and 77 transitions. Second operand 8 states. [2020-02-10 20:15:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:28,099 INFO L93 Difference]: Finished difference Result 70 states and 114 transitions. [2020-02-10 20:15:28,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:28,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:28,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:28,100 INFO L225 Difference]: With dead ends: 70 [2020-02-10 20:15:28,100 INFO L226 Difference]: Without dead ends: 55 [2020-02-10 20:15:28,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:28,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-02-10 20:15:28,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2020-02-10 20:15:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-02-10 20:15:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. [2020-02-10 20:15:28,102 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 72 transitions. Word has length 19 [2020-02-10 20:15:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:28,102 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-02-10 20:15:28,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 72 transitions. [2020-02-10 20:15:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:28,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:28,103 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:28,103 INFO L427 AbstractCegarLoop]: === Iteration 717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:28,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:28,103 INFO L82 PathProgramCache]: Analyzing trace with hash 777853504, now seen corresponding path program 713 times [2020-02-10 20:15:28,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:28,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569292057] [2020-02-10 20:15:28,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:28,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:28,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569292057] [2020-02-10 20:15:28,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:28,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:28,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387683566] [2020-02-10 20:15:28,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:28,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:28,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:28,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:28,305 INFO L87 Difference]: Start difference. First operand 41 states and 72 transitions. Second operand 8 states. [2020-02-10 20:15:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:28,364 INFO L93 Difference]: Finished difference Result 71 states and 119 transitions. [2020-02-10 20:15:28,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:28,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:28,365 INFO L225 Difference]: With dead ends: 71 [2020-02-10 20:15:28,365 INFO L226 Difference]: Without dead ends: 59 [2020-02-10 20:15:28,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-02-10 20:15:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2020-02-10 20:15:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-02-10 20:15:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 80 transitions. [2020-02-10 20:15:28,366 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 80 transitions. Word has length 19 [2020-02-10 20:15:28,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:28,367 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 80 transitions. [2020-02-10 20:15:28,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 80 transitions. [2020-02-10 20:15:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:28,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:28,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:28,367 INFO L427 AbstractCegarLoop]: === Iteration 718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:28,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1633160158, now seen corresponding path program 714 times [2020-02-10 20:15:28,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:28,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247032422] [2020-02-10 20:15:28,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:28,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247032422] [2020-02-10 20:15:28,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:28,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:28,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307110814] [2020-02-10 20:15:28,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:28,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:28,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:28,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:28,569 INFO L87 Difference]: Start difference. First operand 45 states and 80 transitions. Second operand 8 states. [2020-02-10 20:15:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:28,627 INFO L93 Difference]: Finished difference Result 58 states and 98 transitions. [2020-02-10 20:15:28,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:28,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:28,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:28,627 INFO L225 Difference]: With dead ends: 58 [2020-02-10 20:15:28,628 INFO L226 Difference]: Without dead ends: 39 [2020-02-10 20:15:28,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:28,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-02-10 20:15:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-02-10 20:15:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-02-10 20:15:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2020-02-10 20:15:28,629 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 68 transitions. Word has length 19 [2020-02-10 20:15:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:28,629 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 68 transitions. [2020-02-10 20:15:28,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2020-02-10 20:15:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:28,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:28,630 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:28,630 INFO L427 AbstractCegarLoop]: === Iteration 719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:28,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:28,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1654166366, now seen corresponding path program 715 times [2020-02-10 20:15:28,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:28,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015994902] [2020-02-10 20:15:28,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:28,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015994902] [2020-02-10 20:15:28,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:28,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:28,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606806291] [2020-02-10 20:15:28,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:28,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:28,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:28,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:28,832 INFO L87 Difference]: Start difference. First operand 39 states and 68 transitions. Second operand 8 states. [2020-02-10 20:15:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:28,872 INFO L93 Difference]: Finished difference Result 58 states and 88 transitions. [2020-02-10 20:15:28,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:28,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:28,873 INFO L225 Difference]: With dead ends: 58 [2020-02-10 20:15:28,873 INFO L226 Difference]: Without dead ends: 48 [2020-02-10 20:15:28,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-02-10 20:15:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2020-02-10 20:15:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-02-10 20:15:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2020-02-10 20:15:28,874 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 19 [2020-02-10 20:15:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:28,874 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2020-02-10 20:15:28,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2020-02-10 20:15:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:28,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:28,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:28,875 INFO L427 AbstractCegarLoop]: === Iteration 720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:28,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:28,875 INFO L82 PathProgramCache]: Analyzing trace with hash 798859712, now seen corresponding path program 716 times [2020-02-10 20:15:28,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:28,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487868844] [2020-02-10 20:15:28,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:29,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487868844] [2020-02-10 20:15:29,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:29,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:29,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839890549] [2020-02-10 20:15:29,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:29,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:29,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:29,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:29,078 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 8 states. [2020-02-10 20:15:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:29,135 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2020-02-10 20:15:29,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:29,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:29,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:29,136 INFO L225 Difference]: With dead ends: 60 [2020-02-10 20:15:29,136 INFO L226 Difference]: Without dead ends: 46 [2020-02-10 20:15:29,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-02-10 20:15:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2020-02-10 20:15:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-02-10 20:15:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2020-02-10 20:15:29,138 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 19 [2020-02-10 20:15:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:29,138 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. [2020-02-10 20:15:29,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2020-02-10 20:15:29,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:29,139 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:29,139 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:29,139 INFO L427 AbstractCegarLoop]: === Iteration 721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:29,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:29,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1029859972, now seen corresponding path program 717 times [2020-02-10 20:15:29,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:29,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567086977] [2020-02-10 20:15:29,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:29,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567086977] [2020-02-10 20:15:29,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:29,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:29,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913131021] [2020-02-10 20:15:29,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:29,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:29,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:29,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:29,345 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 8 states. [2020-02-10 20:15:29,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:29,383 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2020-02-10 20:15:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:29,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:29,384 INFO L225 Difference]: With dead ends: 54 [2020-02-10 20:15:29,384 INFO L226 Difference]: Without dead ends: 44 [2020-02-10 20:15:29,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-02-10 20:15:29,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2020-02-10 20:15:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-02-10 20:15:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2020-02-10 20:15:29,385 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 19 [2020-02-10 20:15:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:29,386 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2020-02-10 20:15:29,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:29,386 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2020-02-10 20:15:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:29,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:29,386 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:29,386 INFO L427 AbstractCegarLoop]: === Iteration 722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:29,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:29,386 INFO L82 PathProgramCache]: Analyzing trace with hash 459545024, now seen corresponding path program 718 times [2020-02-10 20:15:29,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:29,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067276808] [2020-02-10 20:15:29,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:29,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067276808] [2020-02-10 20:15:29,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:29,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:29,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975382315] [2020-02-10 20:15:29,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:29,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:29,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:29,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:29,586 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 8 states. [2020-02-10 20:15:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:29,646 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2020-02-10 20:15:29,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:29,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:29,647 INFO L225 Difference]: With dead ends: 48 [2020-02-10 20:15:29,647 INFO L226 Difference]: Without dead ends: 33 [2020-02-10 20:15:29,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-02-10 20:15:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-02-10 20:15:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-02-10 20:15:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. [2020-02-10 20:15:29,648 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 51 transitions. Word has length 19 [2020-02-10 20:15:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:29,649 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 51 transitions. [2020-02-10 20:15:29,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 51 transitions. [2020-02-10 20:15:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:29,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:29,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:29,650 INFO L427 AbstractCegarLoop]: === Iteration 723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:29,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:29,650 INFO L82 PathProgramCache]: Analyzing trace with hash -274225668, now seen corresponding path program 719 times [2020-02-10 20:15:29,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:29,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784956292] [2020-02-10 20:15:29,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:29,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784956292] [2020-02-10 20:15:29,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:29,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:29,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998592267] [2020-02-10 20:15:29,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:29,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:29,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:29,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:29,854 INFO L87 Difference]: Start difference. First operand 33 states and 51 transitions. Second operand 8 states. [2020-02-10 20:15:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:29,908 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2020-02-10 20:15:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:29,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:29,908 INFO L225 Difference]: With dead ends: 41 [2020-02-10 20:15:29,908 INFO L226 Difference]: Without dead ends: 29 [2020-02-10 20:15:29,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-02-10 20:15:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-02-10 20:15:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-02-10 20:15:29,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2020-02-10 20:15:29,910 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2020-02-10 20:15:29,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:29,910 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2020-02-10 20:15:29,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2020-02-10 20:15:29,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 20:15:29,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:29,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:29,911 INFO L427 AbstractCegarLoop]: === Iteration 724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:29,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:29,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1029859972, now seen corresponding path program 720 times [2020-02-10 20:15:29,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:29,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450089172] [2020-02-10 20:15:29,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:30,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450089172] [2020-02-10 20:15:30,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:30,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 20:15:30,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396065137] [2020-02-10 20:15:30,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 20:15:30,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:30,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 20:15:30,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:15:30,114 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 8 states. [2020-02-10 20:15:30,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:30,162 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2020-02-10 20:15:30,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 20:15:30,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 20:15:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:30,163 INFO L225 Difference]: With dead ends: 28 [2020-02-10 20:15:30,163 INFO L226 Difference]: Without dead ends: 0 [2020-02-10 20:15:30,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 20:15:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-02-10 20:15:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-02-10 20:15:30,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-02-10 20:15:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-02-10 20:15:30,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-02-10 20:15:30,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:30,164 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-02-10 20:15:30,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 20:15:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-02-10 20:15:30,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-02-10 20:15:30,167 INFO L202 PluginConnector]: Adding new model example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:15:30 BasicIcfg [2020-02-10 20:15:30,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:15:30,168 INFO L168 Benchmark]: Toolchain (without parser) took 208771.95 ms. Allocated memory was 136.3 MB in the beginning and 223.3 MB in the end (delta: 87.0 MB). Free memory was 118.2 MB in the beginning and 89.5 MB in the end (delta: 28.8 MB). Peak memory consumption was 115.8 MB. Max. memory is 7.1 GB. [2020-02-10 20:15:30,169 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.47 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.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:15:30,169 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.14 ms. Allocated memory is still 136.3 MB. Free memory was 118.0 MB in the beginning and 116.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2020-02-10 20:15:30,169 INFO L168 Benchmark]: Boogie Preprocessor took 23.81 ms. Allocated memory is still 136.3 MB. Free memory was 116.2 MB in the beginning and 115.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-02-10 20:15:30,169 INFO L168 Benchmark]: RCFGBuilder took 324.49 ms. Allocated memory is still 136.3 MB. Free memory was 115.1 MB in the beginning and 102.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2020-02-10 20:15:30,170 INFO L168 Benchmark]: TraceAbstraction took 208378.71 ms. Allocated memory was 136.3 MB in the beginning and 223.3 MB in the end (delta: 87.0 MB). Free memory was 102.5 MB in the beginning and 89.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 100.0 MB. Max. memory is 7.1 GB. [2020-02-10 20:15:30,171 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.47 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.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 38.14 ms. Allocated memory is still 136.3 MB. Free memory was 118.0 MB in the beginning and 116.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.81 ms. Allocated memory is still 136.3 MB. Free memory was 116.2 MB in the beginning and 115.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 324.49 ms. Allocated memory is still 136.3 MB. Free memory was 115.1 MB in the beginning and 102.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 208378.71 ms. Allocated memory was 136.3 MB in the beginning and 223.3 MB in the end (delta: 87.0 MB). Free memory was 102.5 MB in the beginning and 89.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 100.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.3s, 52 ProgramPointsBefore, 45 ProgramPointsAfterwards, 63 TransitionsBefore, 56 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 210 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 225 CheckedPairsTotal, 7 TotalNumberOfCompositions - PositiveResult [Line: 25]: 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 7 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. Result: SAFE, OverallTime: 208.1s, OverallIterations: 724, TraceHistogramMax: 1, AutomataDifference: 56.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 48598 SDtfs, 89022 SDslu, 114886 SDs, 0 SdLazy, 25831 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5772 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 5044 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2880 ImplicationChecksByTransitivity, 162.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=794occurred 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: 3.7s AutomataMinimizationTime, 724 MinimizatonAttempts, 91280 StatesRemovedByMinimization, 714 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 142.8s InterpolantComputationTime, 13756 NumberOfCodeBlocks, 13756 NumberOfCodeBlocksAsserted, 724 NumberOfCheckSat, 13032 ConstructedInterpolants, 0 QuantifiedInterpolants, 4750668 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 724 InterpolantComputations, 724 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...